English
Related papers

Related papers: Calibration for minimal surfaces with free boundar…

200 papers

We derive an upper bound on the size of a ball such that the image of the ball under quadratic map is strongly convex and smooth. Our result is the best possible improvement of the analogous result by Polyak in the case of quadratic map. We…

Optimization and Control · Mathematics 2017-10-27 Anatoly Dymarsky

Non-convex optimization is ubiquitous in modern machine learning. Researchers devise non-convex objective functions and optimize them using off-the-shelf optimizers such as stochastic gradient descent and its variants, which leverage the…

Machine Learning · Computer Science 2021-03-26 Tengyu Ma

We study the optimal lower and upper complexity bounds for finding approximate solutions to the composite problem $\min_x\ f(x)+h(Ax-b)$, where $f$ is smooth and $h$ is convex. Given access to the proximal operator of $h$, for strongly…

Optimization and Control · Mathematics 2023-08-15 Zhenyuan Zhu , Fan Chen , Junyu Zhang , Zaiwen Wen

We investigate the properties of the Cheeger sets of rotationally invariant, bounded domains $\Omega \subset \mathbb{R}^n$. For a rotationally invariant Cheeger set $C$, the free boundary $\partial C \cap \Omega$ consists of pieces of…

Optimization and Control · Mathematics 2021-10-22 Vladimir Bobkov , Enea Parini

We describe a factor-revealing convex optimization problem for the integrality gap of the maximum-cut semidefinite programming relaxation: for each $n \geq 2$ we present a convex optimization problem whose optimal value is the largest…

Optimization and Control · Mathematics 2021-03-24 Fernando Mário de Oliveira Filho , Frank Vallentin

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…

Analysis of PDEs · Mathematics 2023-08-09 Stanley Alama , Lia Bronsard , Silas Vriend

In 1970, Lawson solved the topological realization problem for minimal surfaces in the sphere, showing that any closed orientable surface can be minimally embedded in $\mathbb{S}^3$. The analogous problem for surfaces with boundary was…

Differential Geometry · Mathematics 2024-02-21 Mikhail Karpukhin , Robert Kusner , Peter McGrath , Daniel Stern

We introduce an innovative numerical technique based on convex optimization to solve a range of infinite dimensional variational problems arising from the application of the background method to fluid flows. In contrast to most existing…

Fluid Dynamics · Physics 2016-04-13 G. Fantuzzi , A. Wynn

We give a brief literature review of the isoperimetric problem and discuss its relationship with the Cheeger constant of Riemannian $n$-manifolds. For some non-compact, finite area 2-manifolds, we prove the existence and regularity of…

Differential Geometry · Mathematics 2016-01-07 Brian Benson

Nonconvex functionals with spherical symmetry are studied. Existence of one and radial symmetry of all global minimizers is shown with an approach based on convex relaxation.

Classical Analysis and ODEs · Mathematics 2007-05-23 Stefan Krömer

In this short note, we discuss how the optimality conditions for the problem of minimizing a multivariate function subject to equality constraints have been dealt with in undergraduate Calculus. We are particularly interested in the 2 or…

History and Overview · Mathematics 2019-04-11 Ademir Alves Ribeiro , Jose Renato Ramos Barbosa

Classically, Plateau's problem asks to find a surface of the least area with a given boundary $B$. In this article, we investigate a version of Plateau's problem, where the boundary of an admissible surface is only required to partially…

Classical Analysis and ODEs · Mathematics 2023-05-11 Enrique Alvarado , Qinglan Xia

Exact free energy minimization is a convex optimization problem that is usually approximated with stochastic sampling methods. Deterministic approximations have been less successful because many desirable properties have been difficult to…

Computational Physics · Physics 2016-03-17 Jonathan E. Moussa

We describe a convex relaxation for the Gilbert-Steiner problem both in $R^d$ and on manifolds, extending the framework proposed in [9], and we discuss its sharpness by means of calibration type arguments. The minimization of the resulting…

Optimization and Control · Mathematics 2018-10-15 Mauro Bonafini , Édouard Oudet

Non-convex optimization problems have multiple local optimal solutions. Non-convex optimization problems are commonly found in numerous applications. One of the methods recently proposed to efficiently explore multiple local optimal…

Optimization and Control · Mathematics 2022-01-31 Mohamed Tarek , Yijiang Huang

We consider minimization of functions that are compositions of convex or prox-regular functions (possibly extended-valued) with smooth vector functions. A wide variety of important optimization problems fall into this framework. We describe…

Optimization and Control · Mathematics 2015-04-24 A. S. Lewis , S. J. Wright

We introduce a fully-corrective generalized conditional gradient method for convex minimization problems involving total variation regularization on multidimensional domains. It relies on alternatively updating an active set of subsets of…

Optimization and Control · Mathematics 2025-12-01 Giacomo Cristinelli , José A. Iglesias , Daniel Walter

The aim of this paper is to give an upper bound for the intrinsic diameter of a surface with boundary immersed in a conformally flat three dimensional Riemannian manifold in terms of the integral of the mean curvature and of the length of…

Differential Geometry · Mathematics 2023-03-20 Marco Flaim , Christian Scharrer

We revisit the smooth convex-concave bilinearly-coupled saddle-point problem of the form $\min_x\max_y f(x) + \langle y,\mathbf{B} x\rangle - g(y)$. In the highly specific case where each of the functions $f(x)$ and $g(y)$ is either affine…

Optimization and Control · Mathematics 2024-11-25 Dmitry Kovalev , Ekaterina Borodich

We study the problem of finding approximate first-order stationary points in optimization problems of the form $\min_{x \in X} \max_{y \in Y} f(x,y)$, where the sets $X,Y$ are convex and $Y$ is compact. The objective function $f$ is smooth,…

Optimization and Control · Mathematics 2021-10-11 Dmitrii M. Ostrovskii , Babak Barazandeh , Meisam Razaviyayn