Related papers: Convex programs for minimal-area problems
The paper is devoted to new modifications of recently proposed adaptive methods of Mirror Descent for convex minimization problems in the case of several convex functional constraints. Methods for problems of two classes are considered. The…
We discuss two classes of exact (in $\a'$) string solutions described by conformal sigma models. They can be viewed as two possibilities of constructing a conformal model out of the non-conformal one based on the metric of a $D$-dimensional…
Consider a strictly convex bounded regular domain $C$ of $\R^3$. For any arbitrary finite topological type we find a compact Riemann surface $\mathcal{M}$, an open domain $M\subset \mathcal{M}$ with the fixed topological type, and a…
We use a conformal mapping method introduced in a companion paper to study the properties of bi-harmonic fields in the vicinity of rough boundaries. We focus our analysis on two different situations where such bi-harmonic problems are…
We analyze global aspects of the moduli space of K\"ahler forms for $N$=(2,2) conformal $\sigma$-models. Using algebraic methods and mirror symmetry we study extensions of the mathematical notion of length (as specified by a K\"ahler…
Local minimizers for the anisotropic isoperimetric problem in the small-volume regime on closed Riemannian manifolds are shown to be geodesically convex and small smooth perturbations of tangent Wulff shapes, quantitatively in terms of the…
We consider the classical minimum and maximum cut problems: find a partition of vertices of a graph into two disjoint subsets that minimize or maximize the sum of the weights of edges with endpoints in different subsets. It is known that if…
We study the convergence of the Riemannian steepest descent algorithm on the Grassmann manifold for minimizing the block version of the Rayleigh quotient of a symmetric matrix. Even though this problem is non-convex in the Euclidean sense…
The deformation problem for pseudoholomorphic curves and related geometrical properties of the total moduli space of pseudoholomorphic curves are studied. A sufficient condition for the saddle point property of the total moduli space is…
Mathematical programs with complementarity constraints are notoriously difficult to solve due to their nonconvexity and lack of constraint qualifications in every feasible point. This work focuses on the subclass of quadratic programs with…
String backgrounds are described as purely geometric objects related to moduli spaces of Riemann surfaces, in the spirit of Segal's definition of a conformal field theory. Relations with conformal field theory, topological field theory and…
A taming symplectic structure provides an upper bound on the area of an approximately pseudoholomorphic curve in terms of its homology class. We prove that, conversely, an almost complex manifold with such an area bound admits a taming…
In this work, we develop an adaptive algorithm for the efficient numerical solution of the minimum compliance problem in topology optimization. The algorithm employs the phase field approximation and continuous density field. The adaptive…
In a previous work we developed a convex infinite dimensional linear programming (LP) approach to approximating the region of attraction (ROA) of polynomial dynamical systems subject to compact basic semialgebraic state constraints. Finite…
Motivated by the problem of background independence of closed string field theory we study geometry on the infinite vector bundle of local fields over the space of conformal field theories (CFT's). With any connection we can associate an…
We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the minimum cut problem. Our new semidefinite programming relaxation of the minimum cut problem is obtained by strengthening the known…
We show that any convex region which contains a unit segment, an equilateral triangle of sides 1/2, and a square of side 1/3 always has area at least 0.227498. Using grid-search algorithm, we attempt to find a configuration of these three…
Recent quasi-optimal error estimates for the finite element approximation of total-variation regularized minimization problems require the existence of a Lipschitz continuous dual solution. We discuss the validity of this condition and…
Lawson and Osserman proved that the Dirichlet problem for the minimal surface system is not always solvable in the class of Lipschitz maps. However, it is known that minimizing sequences (for area) of Lipschitz graphs converge to objects…
We investigate a family of bilevel imaging learning problems where the lower-level instance corresponds to a convex variational model involving first- and second-order nonsmooth sparsity-based regularizers. By using geometric properties of…