Related papers: Convex programs for minimal-area problems
We prove that if $(M,g)$ is a topological 3-ball with a $C^4$-smooth Riemannian metric $g$, and mean-convex boundary $\partial M$ then knowledge of least areas circumscribed by simple closed curves $\gamma \subset \partial M$ uniquely…
We study surface representatives of homology classes of finite complexes which minimize certain complexity measures, including its genus and Euler characteristic. Our main result is that up to surgery at nullhomotopic curves minimizers are…
We construct and fully characterize a scalar boundary conformal field theory on a triangulated Riemann surface. The results are analyzed from a string theory perspective as tools to deal with open/closed string dualities.
We present an elementary criterion to show the length-minimizing property of geodesics for a large class of conformal metrics. In particular, we prove the length-minimizing property of level curves of harmonic functions and the…
The data-compatibility approach to constrained optimization, proposed here, strives to a point that is "close enough" to the solution set and whose target function value is "close enough" to the constrained minimum value. These notions can…
We explicitly find the minima as well as the minimum points of the geodesic length functions for the family of filling (hence non-simple) closed curves, $a^2b^n$ ($n\ge 3$), on a complete one-holed hyperbolic torus in its relative…
In this paper, we propose a Minimax Trust Region (MINIMAX-TR) algorithm and a Minimax Trust Region Algorithm with Contractions and Expansions(MINIMAX-TRACE) algorithm for solving nonconvex-strongly concave minimax problems. Both algorithms…
Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in $H^k(\Omega)$, and optimizing functionals arising from some…
We extend the results of Riemannian geometry over finite groups and provide a full classification of all linear connections for the minimal noncommutative differential calculus over a finite cyclic group. We solve the torsion-free and…
We consider methods for finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of points in the plane. Both problems are known to be NP-hard; at the center of the recent CG Challenge, practical…
In this paper we examine different aspects of the geometry of closed conformal vector fields on Riemannian manifolds. We begin by getting obstructions to the existence of closed conformal and nonparallel vector fields on complete manifolds…
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…
In this paper we study the local behavior of solutions to some free boundary problems. We relate the theory of quasi-conformal maps to the regularity of the solutions to nonlinear thin-obstacle problems; we prove that the contact set is…
Assume $D$ is a finite set and $R$ is a finite set of functions from $D$ to the natural numbers. An instance of the minimum $R$-cost homomorphism problem ($MinHom_R$) is a set of variables $V$ subject to specified constraints together with…
This article investigates the approximation quality achievable for biobjective minimization problems with respect to the Pareto cone by solutions that are (approximately) optimal with respect to larger ordering cones. When simultaneously…
The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our…
This paper provides necessary and sufficient optimality conditions for abstract constrained mathematical programming problems in locally convex spaces under new qualification conditions. Our approach exploits the geometrical properties of…
Stability of nonconvex quadratic programming problems under finitely many convex quadratic constraints in Hilbert spaces is investigated. We present several stability properties of the global solution map, and the continuity of the optimal…
We introduce a new family of closed differential forms naturally associated with minimal graphical submanifolds in Euclidean space, defined in arbitrary codimension. For each minimal graph, we construct an explicit closed form whose…
We propose a conditional gradient framework for a composite convex minimization template with broad applications. Our approach combines smoothing and homotopy techniques under the CGM framework, and provably achieves the optimal…