相关论文: Minimisers of supremal functionals and mass-minimi…
Consider the supremal functional \[ \tag{1} \label{1} E_\infty(u,A) \,:=\, \|L(\cdot,u,D u)\|_{L^\infty(A)},\quad A\subseteq \Omega, \] applied to $W^{1,\infty}$ maps $u:\Omega\subseteq \mathbb{R}\longrightarrow \mathbb{R}^N$, $N\geq 1$.…
We discuss a special class of solutions to the minimal surface system. These are vector-valued functions that "decrease area" and are natural generalization of scalar functions. After defining area-decreasing maps, we show several classical…
We study minimisation problems in $L^\infty$ for general quasiconvex first order functionals, where the class of admissible mappings is constrained by the sublevel sets of another supremal functional and by the zero set of a nonlinear…
We introduce a general framework for the reconstruction of vector-valued functions from finite and possibly noisy data, acquired through a known measurement operator. The reconstruction is done by the minimization of a loss functional…
This paper deals with extensions of vector-valued functions on finite graphs fulfilling distinguished minimality properties. We show that so-called lex and L-lex minimal extensions are actually the same and call them minimal Lipschitz…
We consider the problem of minimising the $L^\infty$ norm of a function of the hessian over a class of maps, subject to a mass constraint involving the $L^\infty$ norm of a function of the gradient and the map itself. We assume zeroth and…
In this paper we study integer multiplicity rectifiable currents carried by the subgradient (subdifferential) graphs of semi-convex functions on a $n$-dimensional convex domain, and show a weak continuity theorem with respect to pointwise…
We prove several results on Almgren's multiple valued functions and their links to integral currents. In particular, we give a simple proof of the fact that a Lipschitz multiple valued map naturally defines an integer rectifiable current;…
We study a minimisation problem in $L^p$ and $L^\infty$ for certain cost functionals, where the class of admissible mappings is constrained by the Navier-Stokes equations. Problems of this type are motivated by variational data assimilation…
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…
The recent literature has intensively studied two classes of nonlocal variational problems, namely the ones related to the minimisation of energy functionals that act on functions in suitable Sobolev-Gagliardo spaces, and the ones related…
Scalarization in vector optimization is essentially based on the minimization of Gerstewitz functionals. In this paper, the minimizer sets of Gerstewitz functionals are investigated. Conditions are given under which such a set is nonempty…
In this paper, vector optimization is considered in the framework of decision making and optimization in general spaces. Interdependencies between domination structures in decision making and domination sets in vector optimization are…
In this paper we establish weak continuity results for the distribution Jacobian minors in fractional sobolev spaces, which can be seen as a extension of recent work of Brezis and Nguyen on the distributional Jacobian determinant. Then we…
The optimization problem concerning the determination of the minimizer for the sum of convex functions holds significant importance in the realm of distributed and decentralized optimization. In scenarios where full knowledge of the…
Techniques based on minimal graph cuts have become a standard tool for solving combinatorial optimization problems arising in image processing and computer vision applications. These techniques can be used to minimize objective functions…
Multivariate functions encountered in high-dimensional uncertainty quantification problems often vary most strongly along a few dominant directions in the input parameter space. We propose a gradient-based method for detecting these…
This paper presents generalizations of semidefinite programming formulations of 1-norm optimization problems over infinite dictionaries of vectors of complex exponentials, which were recently proposed for superresolution, gridless…
The existence of minimizers of the Canham--Helfrich functional in the setting of generalized Gauss graphs is proved. As a first step, the Canham--Helfrich functional, usually defined on regular surfaces, is extended to generalized Gauss…
The maximum (or minimum) generalized eigenvalue of symmetric positive semidefinite matrices that depend on optimization variables often appears as objective or constraint functions in structural topology optimization when we consider…