Related papers: The area minimizing problem in conformal cones
In this paper, we study the problem of computing a homotopy from a planar curve $C$ to a point that minimizes the area swept. The existence of such a minimum homotopy is a direct result of the solution of Plateau's problem. Chambers and…
Minimax optimization problems arises from both modern machine learning including generative adversarial networks, adversarial training and multi-agent reinforcement learning, as well as from tradition research areas such as saddle point…
In this paper, we consider the problem of minimizing a difference-of-convex objective over a nonlinear conic constraint, where the cone is closed, convex, pointed and has a nonempty interior. We assume that the support function of a compact…
In many applications it is important to establish if a given topological preordered space has a topology and a preorder which can be recovered from the set of continuous isotone functions. Under antisymmetry this property, also known as…
We study certain obstacle type problems involving standard and nonlocal minimal surfaces. We obtain optimal regularity of the solution and a characterization of the free boundary.
We show that in the setting of proper metric spaces one obtains a solution of the classical two-dimensional Plateau problem by minimizing the energy, as in the classical case, once a definition of area (in the sense of convex geometry) has…
We consider compact connected minimal surfaces, with a pair of boundary curves (not necessarily convex) in distinct planes, that have least-area amongst all orientable surfaces with the same boundary. When the planes containing these two…
We establish a general formula for the enclosed volume of constant mean curvature (CMC) surfaces in Euclidean three space with translational periods forming a lattice. The formula relates the volume to the surface area, a…
The main challenge of nonconvex optimization is to find a global optimum, or at least to avoid ``bad'' local minima and meaningless stationary points. We study here the extent to which algorithms, as opposed to optimization models and…
Nonconvex functionals with spherical symmetry are studied. Existence of one and radial symmetry of all global minimizers is shown with an approach based on convex relaxation.
Deciding whether saddle points exist or are approximable for nonconvex-nonconcave problems is usually intractable. This paper takes a step towards understanding a broad class of nonconvex-nonconcave minimax problems that do remain…
We construct geometric barriers for minimal graphs in H^n xR. We prove the existence and uniqueness of a solution of the vertical minimal equation in the interior of a convex polyhedron in H^n extending continuously to the interior of each…
Let N be a complete, homogeneously regular Riemannian manifold of dimension greater than 2 and let M be a compact submanifold of N. Let $\Sigma$ be a compact orientable surface with boundary. We show that for any continuous $f: (\Sigma,…
This paper defines a convertible nonconvex function(CN function for short) and a weak (strong) uniform (decomposable, exact) CN function, proves the optimization conditions for their global solutions and proposes algorithms for solving the…
We consider volume-constrained minimizers of the fractional perimeter with the addition of a potential energy in the form of a volume inte- gral. Such minimizers are solutions of the prescribed fractional curvature problem. We prove…
It is a well known phenomenon that many classical minimal surfaces in Euclidean space also exist with higher dihedral symmetry. More precisely, these surfaces are solutions to free boundary problems in a wedge bounded by two vertical planes…
We show that the minimization problem of any non-convex and non-lower semi-continuous function on a compact convex subset of a locally convex real topological vector space can be studied via an associated convex and lower semi-continuous…
In this paper we find approximate solutions of certain Riemann-Hilbert boundary value problems for minimal surfaces in $\mathbb{R}^n$ and null holomorphic curves in $\mathbb{C}^n$ for any $n\ge 3$. With this tool in hand we construct…
We study a variational problem for the perimeter associated with the Grushin plane, called minimal partition problem with trace constraint. This consists in studying how to enclose three prescribed areas in the Grushin plane, using the…
It is well known that a strictly convex minimand admits at most one minimizer. We prove a partial converse: Let $X$ be a locally convex Hausdorff space and $f \colon X \mapsto \left( - \infty , \infty \right]$ a function with compact…