Related papers: A direct approach to Plateau's problem in any codi…
This paper describes a new approach on optimization of constraint satisfaction problems (CSPs) by means of substituting sub-CSPs with locally consistent regular membership constraints. The purpose of this approach is to reduce the number of…
Nearest neighbor classifier is arguably the most simple and popular nonparametric classifier available in the literature. However, due to the concentration of pairwise distances and the violation of the neighborhood structure, this…
In this paper, we prove the existence of minimizers of a class of multi-constrained variational problems. We consider systems involving a nonlinearity that does not satisfy compactness, monotonicity, neither symmetry properties. Our…
The existence of Dirichlet minimizing multiple-valued functions for given boundary data has been known since pioneering work of F. Almgren. Here we prove a multiple-valued analogue of the classical Plateau problem of the existence of…
In exact sparse optimization problems on Rd (also known as sparsity constrained problems), one looks for solution that have few nonzero components. In this paper, we consider problems where sparsity is exactly measured either by the…
In this paper we prove the existence of a solution to a nonlinear Schr{\"o}dinger--Poisson eigenvalue problem in dimension less than $3$. Our proof is based on a global approach to the determination of eigenvalues and eigenfunctions which…
We establish sufficient conditions for existence of curves minimizing length as measured with respect to a degenerate metric on the plane while enclosing a specified amount of Euclidean area. Non-existence of minimizers can occur and…
In recent years, there has been a growing interest in mathematical models leading to the minimization, in a symmetric matrix space, of a Bregman divergence coupled with a regularization term. We address problems of this type within a…
We study the minimization of convex, variational integrals of linear growth among all functions in the Sobolev space $W^{1,1}$ with prescribed boundary values (or its equivalent formulation as a boundary value problem for a degenerately…
The aim of this paper is to study a concentration-compactness principle for inhomogeneous fractional Sobolev space $H^s (\mathbb{R}^N)$ for $0<s\leq N/2.$ As an application we establish Palais-Smale compactness for the Lagrangian associated…
Inspired by a planar partitioning problem involving multiple improper chambers, this article investigates using classical techniques what can be said of the existence, uniqueness, and regularity of minimizers in a certain free-endpoint…
We prove a monotonicity formula for minimal or almost minimal sets for the Hausdorff measure $\cal{H}^d$, subject to a sliding boundary constraint where competitors for $E$ are obtained by deforming $E$ by a one-parameter family of…
We study the existence of area-minimizing homotopies between homotopic curves in the plane. While the classical Plateau problem establishes the existence of least-area surfaces spanning a single Jordan curve, the corresponding existence…
We are interested in the existence of Pareto solutions to the vector optimization problem $$\text{Min}_{\,\mathbb{R}^m_+} \{f(x) \,|\, x\in \mathbb{R}^n\},$$ where $f\colon\mathbb{R}^n\to \mathbb{R}^m$ is a polynomial map. By using the {\em…
Let $X$ be a compact connected strongly pseudoconvex $CR$ manifold of real dimension $2n-1$ in $\mathbb{C}^{N}$. For $n\ge 3$, Yau solved the complex Plateau problem of hypersurface type by checking a bunch of Kohn-Rossi cohomology groups…
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…
We extend to the anisotropic setting the existence of solutions for the Kirchhoff-Plateau problem and its dimensional reduction.
The permanent vs. determinant problem is one of the most important problems in theoretical computer science, and is the main target of geometric complexity theory proposed by Mulmuley and Sohoni. The current best lower bound for the…
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…
In this paper, we consider a well-known sparse optimization problem that aims to find a sparse solution of a possibly noisy underdetermined system of linear equations. Mathematically, it can be modeled in a unified manner by minimizing…