Related papers: The planar Least Gradient problem in convex domain…
Let \Omega and \tilde{\Omega} be uniformly convex domains in \mathbb{R}^n with smooth boundary. We show that there exists a diffeomorphism f: \Omega \to \tilde{\Omega} such that the graph \Sigma = \{(x,f(x)): x \in \Omega\} is a minimal…
Solving the Plateau problem means to find the surface with minimal area among all surfaces with a given boundary. Part of the problem actually consists of giving a suitable definition to the notions of 'surface', 'area' and 'boundary'. In…
Bilevel optimization minimizes an objective function, defined by an upper-level problem whose feasible region is the solution of a lower-level problem. We study the oracle complexity of finding an $\epsilon$-stationary point with…
We study existence, structure, uniqueness and regularity of solutions of the obstacle problem \begin{equation*} \inf_{u\in BV_f(\Omega)}\int_{\mathbb{R}^n}\phi(x,Du), \end{equation*} where $BV_f(\Omega)=\{u\in BV(\Omega): u\geq \psi \text{…
We study the consequences of the equivalence between the least gradient problem and a boundary-to-boundary optimal transport problem in two dimensions. We extend the relationship between the two problems to their respective dual problems,…
We revisit the question of existence and regularity of minimizers to weighted least gradient problems on a fixed bounded domain, subject to a Dirichlet boundary condition, in the case where the boundary data is continuous and the weight…
It is well known that bilevel optimization problems are hard to solve both in theory and practice. In this paper, we highlight a further computational difficulty when it comes to solving bilevel problems with continuous but nonconvex lower…
We introduce and study level-planar straight-line drawings with a fixed number $\lambda$ of slopes. For proper level graphs, we give an $O(n \log^2 n / \log \log n)$-time algorithm that either finds such a drawing or determines that no such…
The convergence behavior of gradient methods for minimizing convex differentiable functions is one of the core questions in convex optimization. This paper shows that their well-known complexities can be achieved under conditions weaker…
We study the behavior of first-order methods applied to a lower-unbounded convex function $f$, i.e., $\inf f = -\infty$. Such a setting has received little attention since the trajectories of gradient descent and Nesterov's accelerated…
We prove existence of partitions of an open set $\Omega$ with a given number of phases, which minimize the sum of the fractional perimeters of all the phases, with Dirichlet boundary conditions. In two dimensions we show that, if the…
Invex programs are a special kind of non-convex problems which attain global minima at every stationary point. While classical first-order gradient descent methods can solve them, they converge very slowly. In this paper, we propose new…
Given a graph $G$ and sets $\{\alpha_v~|~v \in V(G)\}$ and $\{\beta_v~|~v \in V(G)\}$ of non-negative integers, it is known that the decision problem whether $G$ contains a spanning tree $T$ such that $\alpha_v \le d_T (v) \le \beta_v $ for…
The eigenvalue problem for the Laplacian on bounded, planar, convex domains with mixed boundary conditions is considered, where a Dirichlet boundary condition is imposed on a part of the boundary and a Neumann boundary condition on its…
Let $\Omega$ be a smooth bounded simply connected domain in $\mathbb{R}^2$. We investigate the existence of critical points of the energy $E_\varepsilon (u)=1/2\int_\Omega |\nabla u|^2+1/(4\varepsilon^2)\int_\Omega (1-|u|^2)^2$, where the…
Computing planar orthogonal drawings with the minimum number of bends is one of the most relevant topics in Graph Drawing. The problem is known to be NP-hard, even when we want to test the existence of a rectilinear planar drawing, i.e., an…
In this paper we consider a class of continuity equations that are conditioned to stay in general space-time domains, which is formulated as a continuum limit of interacting particle systems. Firstly, we study the well-posedness of the…
We give sufficient conditions for the existence and uniqueness, in bounded uniformly convex domains $\Omega$, of solutions of degenerate elliptic equations depending also on the nonlinear gradient term $H$, in term of the size of $\Omega$,…
introduce {\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$…
Motivated by Hadwiger's conjecture and related problems for list-coloring, we study graphs $H$ for which every graph with minimum degree at least $|V(H)|-1$ contains $H$ as a minor. We prove that a large class of apex-outerplanar graphs…