Related papers: The area minimizing problem in conformal cones
In this paper, we investigate the problem of finding minimal graphs in $M^n\times\mathbb R$ with general boundary conditions using a variational approach. We look at so called generalized solutions of the Dirichlet Problem that minimize a…
We introduce and study a generalized concept of boundedness of a subset of a normed vector space with respect to a cone, which is defined as lower boundedness of the images of the underlying set through all the positive functionals of the…
This paper considers a class of nonsmooth nonconvex-nonconcave min-max problems in machine learning and games. We first provide sufficient conditions for the existence of global minimax points and local minimax points. Next, we establish…
This paper introduces an abstract framework for randomized subspace correction methods for convex optimization, which unifies and generalizes a broad class of existing algorithms, including domain decomposition, multigrid, and block…
In this paper we study the Dirichlet problem of translating mean curvature equations over domains in Riemannian manifolds with dimension $n$. Imitating the generalized solution theory of Miranda-Giusti, we define a new conformal area…
Alternating minimization heuristics seek to solve a (difficult) global optimization task through iteratively solving a sequence of (much easier) local optimization tasks on different parts (or blocks) of the input parameters. While popular…
Motivated by the study of the non-parametric area $\mathcal A$ of the graph of the vortex map $u$ (a two-codimensional singular surface in $\mathbb R^4$) over the disc $\Omega \subset \mathbb R^2$ of radius $l$, we perform a careful…
We show that for a generic nullhomotopic simple closed curve C in the boundary of a compact, orientable, mean convex 3-manifold M with trivial second homology, there is a unique area minimizing disk D embedded in M where the boundary of D…
Study about theory and algorithms for constrained optimization usually assumes that the feasible region of the optimization problem is nonempty. However, there are many important practical optimization problems whose feasible regions are…
Venn diagrams are a graphical way to represent a set system. Each of the n sets is represented by a simple closed curve. The n curves subdivide the plane into 2^n open connected regions, each of which represents the intersection of its…
A mean-convex set can be regarded as a barrier for the construction of minimal surfaces. Namely, if we are given a mean-convex set and a null-homotopic Jordan curve on its boundary, then there exists an embedded minimal disk with boundary…
Motivated by applications in materials science, a set of quasiconvexity at the boundary conditions is introduced for domains that are locally diffeomorphic to cones. These conditions are shown to be necessary for strong local minimisers in…
We prove the existence of sectors of minimal growth for general closed extensions of elliptic cone operators under natural ellipticity conditions. This is achieved by the construction of a suitable parametrix and reduction to the boundary.…
For $\Omega_\e=(0,\e)\times (0,1)$ a thin rectangle, we consider minimization of the two-dimensional nonlocal isoperimetric problem given by \[ \inf_u E^{\gamma}_{\Omega_\e}(u)\] where \[ E^{\gamma}_{\Omega_\e}(u):=…
In this paper, the proximal point algorithm for quasi-convex minimization problem in nonpositive curvature metric spaces is studied. We prove $\Delta$-convergence of the generated sequence to a critical point (which is defined in the text)…
In this note we propose a min-max theory for embedded hypersurfaces with a fixed boundary and apply it to prove several theorems about the existence of embedded minimal hypersurfaces with a given boundary. A simpler variant of these…
In this paper we study a general class of nonlinear elliptic problems in divergence form. First, we prove that the solutions to these problems satisfy a convexity property when the given domain is strictly convex. Then, making use of this…
We consider the problem of approximating the solution of variational problems subject to the constraint that the admissible functions must be convex. This problem is at the interface between convex analysis, convex optimization, variational…
In this paper, we study a class of problems where the sum of truncated convex functions is minimized. In statistical applications, they are commonly encountered when $\ell_0$-penalized models are fitted and usually lead to NP-Hard…
We solve the classical problem of Plateau in the setting of proper metric spaces. Precisely, we prove that among all disc-type surfaces with prescribed Jordan boundary in a proper metric space there exists an area minimizing disc which…