Related papers: Convex programs for minimal-area problems
By a conformal string in Euclidean space is meant a closed critical curve with non-constant conformal curvatures of the conformal arclength functional. We prove that (1) the set of conformal classes of conformal strings is in 1-1…
The string vertices of closed string field theory are subsets of the moduli spaces of punctured Riemann surfaces that satisfy a geometric version of the Batalin-Vilkovisky master equation. We present a homological proof of existence of…
The contributions of this technical note are twofold. Firstly, we formulate an optimization problem to obtain a linear representation of a nonlinear vector field based on a system's trajectory. We also prove that its cost function is…
In this paper we present a first-order method that admits near-optimal convergence rates for convex/concave min-max problems while requiring a simple and intuitive analysis. Similarly to the seminal work of Nemirovski and the recent…
The central problem of strip theory is the calculation of potential flowaround 2D sections. One particular method of solutions to this problem is conformal mapping of the body section to the unit circle over which a solution of potential…
This paper presents global optimal solutions to a nonconvex quadratic minimization problem over a sphere constraint. The problem is well-known as a trust region subproblem and has been studied extensively for decades. The main challenge is…
We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…
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…
We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…
The Alternating Minimization Algorithm (AMA) has been proposed by Tseng to solve convex programming problems with two-block separable linear constraints and objectives, whereby (at least) one of the components of the latter is assumed to be…
The Hasse principle in number theory states that information about integral solutions to Diophantine equations can be pieced together from real solutions and solutions modulo prime powers. We show that the Hasse principle holds for…
We study properties of the minimal surface in the Area Law Solution \cite{M93}, \cite{M19a}, \cite{M19b}. We find out that Area Law holds exactly for 2D turbulence as well as for arbitrary planar loop in higher dimensions. This relies on…
In this paper, we show that for a minimal pose-graph problem, even in the ideal case of perfect measurements and spherical covariance, using the so-called "wrap function" when comparing angles results in multiple suboptimal local minima. We…
Convex-concave min-max problems are ubiquitous in machine learning, and people usually utilize first-order methods (e.g., gradient descent ascent) to find the optimal solution. One feature which separates convex-concave min-max problems…
We prove that the density of a topologically nontrivial, area-minimizing hypercone with an isolated singularity must be greater than the square root of 2. The Simons' cones show that this is the best possible constant. If one of the…
We study geometric variational problems for a class of nonlinear sigma-models in quantum field theory. Mathematically, one needs to minimize an energy functional on homotopy classes of maps from closed 3-manifolds into compact homogeneous…
Many classical results in algebraic geometry arise from investigating some extremal behaviors that appear among projective varieties not lying on any hypersurface of fixed degree. We study two numerical invariants attached to such…
In this paper, we present sufficient conditions ensuring that the sum of the image of quadratic functions and the nonnegative orthant is convex. The hidden convexity of the trust-region problem with linear inequality constraints is…
For digraphs $G$ and $H$, a homomorphism of $G$ to $H$ is a mapping $f:\ V(G)\dom V(H)$ such that $uv\in A(G)$ implies $f(u)f(v)\in A(H)$. If, moreover, each vertex $u \in V(G)$ is associated with costs $c_i(u), i \in V(H)$, then the cost…
The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over…