Related papers: Convex programs for minimal-area problems

In this work, we analyze two of the most fundamental algorithms in geodesically convex optimization: Riemannian gradient descent and (possibly inexact) Riemannian proximal point. We quantify their rates of convergence and produce different…

Bundle methods have been intensively studied for solving both convex and nonconvex optimization problems. In most of the bundle methods developed thus far, at least one quadratic programming (QP) subproblem needs to be solved in each…

We show that the minimization problem of any non-convex and non-lower semi-continuous function on a compact convex subset of a locally convex real topological vector space can be studied via an associated convex and lower semi-continuous…

We demonstrate the existence of branched immersed 2-spheres with prescribed mean curvature, with controlled Morse index and with arbitrary codimensions in closed Riemannian manifold $N$ admitting finite fundamental group, where $\pi_k(N)…

In these introductory notes I explain some basic ideas in string field theory. These include: the concept of a string field, the issue of background independence, the reason why minimal area metrics solve the problem of generating all…

We prove some regularity results for a connected set S in the planar domain O, which minimizes the compliance of its complement O\S, plus its length. This problem, interpreted as to find the best location for attaching a membrane subject to…

The well-posedness of a phase-field approximation to the Willmore flow with area and volume constraints is established when the functional approximating the area has no critical point satisfying the two constraints. The existence proof…

In this article, we provide new structural results and algorithms for the Homotopy Height problem. In broad terms, this problem quantifies how much a curve on a surface needs to be stretched to sweep continuously between two positions. More…

This paper considers a networked system with a finite number of users and supposes that each user tries to minimize its own private objective function over its own private constraint set. It is assumed that each user's constraint set can be…

We prove the existence and uniqueness of harmonic maps in degree one homotopy classes of closed, orientable surfaces of positive genus, when the target has conic points with cone angles less than $2\pi$. For a cone point $p$ of cone angle…

We prove several geometric theorems using tools from the theory of convex optimization. In the Riemannian setting, we prove the max flow-min cut theorem for boundary regions, applied recently to develop a "bit-thread" interpretation of…

We prove the existence of immersed closed curves of constant geodesic curvature in an arbitrary Riemannian 2-sphere for almost every prescribed curvature. To achieve this, we develop a min-max scheme for a weighted length functional.

We study the finite element approximation of the solid isotropic material with penalization method (SIMP) for the topology optimization problem of minimizing the compliance of a linearly elastic structure. To ensure the existence of a local…

In this paper, we consider a class of structured nonsmooth fractional minimization, where the first part of the objective is the ratio of a nonnegative nonsmooth nonconvex function to a nonnegative nonsmooth convex function, while the…

To certain geometries, string theory associates conformal field theories. We discuss techniques to perform the reverse procedure: To recover geometrical data from abstractly defined conformal field theories. This is done by introducing…

In this paper we present a new semidefinite programming hierarchy for covering problems in compact metric spaces. Over the last years, these kind of hierarchies were developed primarily for geometric packing and for energy minimization…

A major obstacle to non-convex optimization is the problem of getting stuck in local minima. We introduce a novel metaheuristic to handle this issue, creating an alternate Hamiltonian that shares minima with the original Hamiltonian only…

This paper studies Minimum Spanning Trees under incomplete information for its vertices. We assume that no information is available on the precise placement of vertices so that it is only known that vertices belong to some neighborhoods…

Recently, a new local optimality concept for minimax problems, termed calm local minimax points, has been introduced. In this paper, we extend this concept to a general class of nonsmooth, nonconvex nonconcave minimax problems with coupled…

We consider optimal control problems that have binary-valued control input functions and a perimeter regularization. We develop and analyze a trust-region algorithm that solves a sequence of subproblems in which the regularization term and…