Related papers: Singular Abreu equations and minimizers of convex …
We revisit the problem of approximating minimizers of certain convex functionals subject to a convexity constraint by solutions of fourth order equations of Abreu type. This approximation problem was studied in previous works of…
We study the solvability of the second boundary value problem for a class of highly singular fourth order equations of Monge-Amp\`ere type. They arise in the approximation of convex functionals subject to a convexity constraint using Abreu…
In this note, we prove that minimizers of convex functionals with a convexity constraint and a general class of Lagrangians can be approximated by solutions to fourth-order equations of Abreu type. Our result generalizes that of Le (Twisted…
We show in all dimensions that minimizers of variational problems with a convexity constraint, which arise from the Rochet-Chon\'e model with a quadratic cost in the monopolist's problem in economics, can be approximated in the uniform norm…
Singular fourth-order Abreu equations have been used to approximate minimizers of convex functionals subject to a convexity constraint in dimensions higher than or equal to two. For Abreu type equations, they often exhibit different…
We study the solvability of singular Abreu equations which arise in the approximation of convex functionals subject to a convexity constraint. Previous works established the solvability of their second boundary value problems either in two…
In this paper we prove the existence and regularity of solutions to the first boundary value problem for Abreu's equation, which is a fourth order nonlinear partial differential equation closely related to the Monge-Ampere equation. The…
We study the solvability of the second boundary value problem of a class of highly singular, fully nonlinear fourth order equations of Abreu type in higher dimensions under either a smallness condition or radial symmetry.
In this paper, we establish local and global regularity estimates for linearized Monge-Amp\`ere equations in divergence form via critical Lorentz space estimates for the Green's function of the linearized Monge-Amp\`ere operator and its…
We prove the existence of minimizers for functionals defined over the class of convex domains contained inside a bounded set D of R^N and with prescribed volume. Some applications are given, in particular we prove that the eigenvalues of…
We obtain regularity conditions of a new type of problems of the calculus of variations with second-order derivatives. As a corollary, we get non-occurrence of the Lavrentiev phenomenon. Our main result asserts that autonomous integral…
To every nearly convex optimization problem, that is a minimization problem with a nearly convex objective function and a nearly convex constraint set, we associate a uniquely defined convex optimization problem with a lower semicontinuous…
In this paper, we consider a nonconvex optimization problem with nonlinear equality constraints. We assume that both, the objective function and the functional constraints are locally smooth. For solving this problem, we propose a…
We present a new feasible proximal gradient method for constrained optimization where both the objective and constraint functions are given by the summation of a smooth, possibly nonconvex function and a convex simple function. The…
This paper studies simple bilevel problems, where a convex upper-level function is minimized over the optimal solutions of a convex lower-level problem. We first show the fundamental difficulty of simple bilevel problems, that the…
There are many important practical optimization problems whose feasible regions are not known to be nonempty or not, and optimizers of the objective function with the least constraint violation prefer to be found. A natural way for dealing…
Numerous tasks in imaging and vision can be formulated as variational problems over vector-valued maps. We approach the relaxation and convexification of such vectorial variational problems via a lifting to the space of currents. To that…
We study a class of semilinear free boundary problems in which admissible functions $u$ have a topological constraint, or spanning condition, on their 1-level set. This constraint forces $\{u=1\}$, which is the free boundary, to behave like…
In this paper a robust second-order method is developed for the solution of strongly convex l1-regularized problems. The main aim is to make the proposed method as inexpensive as possible, while even difficult problems can be efficiently…
This paper is devoted to the theoretical and numerical investigation of an augmented Lagrangian method for the solution of optimization problems with geometric constraints. Specifically, we study situations where parts of the constraints…