Related papers: (Non)uniqueness of minimizers in the least gradien…
The paper deals with the distributed minimum sharing problem: a set of decision-makers compute the minimum of some local quantities of interest in a distributed and decentralized way by exchanging information through a communication…
We study existence of minimizers of the general least gradient problem \[\inf_{u \in BV_f} \int_{\Omega}\varphi(x,Du),\] where $BV_f=\{u \in BV(\Omega): \ \ u|_{\partial \Omega}=f\}$, $f\in L^{1}(\partial \Omega)$, and $\varphi(x,\xi)$ is…
Recent quasi-optimal error estimates for the finite element approximation of total-variation regularized minimization problems require the existence of a Lipschitz continuous dual solution. We discuss the validity of this condition and…
In the literature, necessary and sufficient conditions in terms of variational inequalities are introduced to characterize minimizers of convex set valued functions with values in a conlinear space. Similar results are proved for a weaker…
We consider an optimal control problem describing a laser-induced population transfer on a $n$-level quantum system. For a convex cost depending only on the moduli of controls (i.e. the lasers intensities), we prove that there always exists…
Consider a compact $M \subset \mathbb{R}^d$ and $r > 0$. A maximal distance minimizer problem is to find a connected compact set $\Sigma$ of the minimal length, such that \[ \max_{y \in M} dist (y, \Sigma) \leq r. \] The inverse problem is…
We construct least squares formulations of PDEs with inhomogeneous essential boundary conditions, where boundary residuals are not measured in unpractical fractional Sobolev norms, but which formulations nevertheless are shown to yield a…
We study two special cases of the planar least gradient problem. In the first one, the boundary conditions are imposed on a part of the strictly convex domain. In the second case, we impose the Dirichlet data on the boundary of a rectangle,…
We consider sets in $\mathbb R^N$ which minimise, for fixed volume, the sum of the perimeter and a non-local term given by the double integral of a kernel $g:\mathbb R^N\setminus\{0\}\to \mathbb R^+$. We establish some general existence and…
Bilevel optimization and bilevel minimax optimization have recently emerged as unifying frameworks for a range of machine-learning tasks, including hyperparameter optimization and reinforcement learning. The existing literature focuses on…
The aim of decentralized gradient descent (DGD) is to minimize a sum of $n$ functions held by interconnected agents. We study the stability of DGD in open contexts where agents can join or leave the system, resulting each time in the…
In this paper, we derive explicit second-order necessary and sufficient optimality conditions of a local minimizer to an optimal control problem for a quasilinear second-order partial differential equation with a piecewise smooth but not…
Since the seminal work of Schoen-Uhlenbeck, many authors have studied properties of harmonic maps satisfying Dirichlet boundary conditions. In this article, we instead investigate regularity and symmetry of $\mathbb{S}^2-$valued minimizing…
We present uniqueness results for enclosing ellipses of minimal area in the hyperbolic plane. Uniqueness can be guaranteed if the minimizers are sought among all ellipses with prescribed axes or center. In the general case, we present a…
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{…
Partial calmness is a celebrated but restrictive property of bilevel optimization problems whose presence opens a way to the derivation of Karush--Kuhn--Tucker-type necessary optimality conditions in order to characterize local minimizers.…
For a large class of variational problems we prove that minimizers are symmetric whenever they are $C^1$.
A subset of vertices of a graph is minimal if, within all subsets of the same size, its vertex boundary is minimal. We give a complete, geometric characterization of minimal sets for the planar integer lattice X. Our characterization…
A counterexample to uniqueness of global minimizers of semilinear optimal control problems is given. The lack of uniqueness occurs for a special choice of the state-target in the cost functional. Our arguments show also that, for some…
Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…