Related papers: The area minimizing problem in conformal cones

In this paper, we give a necessary and sufficient condition for a graphical strip in the Heisenberg group $\mathbb{H}$ to be area-minimizing in the slab $\{-1<x<1\}$. We show that our condition is necessary by introducing a family of…

The use of min-max optimization in adversarial training of deep neural network classifiers and training of generative adversarial networks has motivated the study of nonconvex-nonconcave optimization objectives, which frequently arise in…

We discuss conformal manifolds for conformal field theories with boundaries or defects. Using conformal perturbation theory we derive constraints on coefficients appearing in the boundary operator product expansion and three-point functions…

Consider a domain D in R^3 which is convex (possibly all R^3) or which is smooth and bounded. Given any open surface M, we prove that there exists a complete, proper minimal immersion f : M --> D. Moreover, if D is smooth and bounded, then…

This paper is concerned with the regularity of shape optimizers of a class of isoperimetric problems under convexity constraint. We prove that minimizers of the sum of the perimeter and a perturbative term, among convex shapes, are C…

We study the Dirichlet problem for minimal surface systems in arbitrary dimension and codimension via mean curvature flow, and obtain the existence of minimal graphs over arbitrary mean convex bounded $C^2$ domains for a large class of…

We consider a variational model for periodic partitions of the upper half-space into three regions, where two of them have prescribed volume and are subject to the geometrical constraint that their union is the subgraph of a function, whose…

This note concerns the area growth and bottom spectrum of complete stable minimal surfaces in a three-dimensional manifold with scalar curvature bounded from below. When the ambient manifold is the Euclidean space, by an elementary…

Min-max problems have broad applications in machine learning, including learning with non-decomposable loss and learning with robustness to data distribution. Convex-concave min-max problem is an active topic of research with efficient…

Let n points be placed on a closed convex domain on the plane, no three points on a straight line. A conjecture by H. A. Heilbronn (before 1950) stated that on the convex domain of unit area the smallest triangle defined by these points has…

We consider the problem of estimating the volume of a compact domain in a Euclidean space based on a uniform sample from the domain. We assume the domain has a boundary with positive reach. We propose a data splitting approach to correct…

We discuss in this note the stickiness phenomena for nonlocal minimal surfaces. Classical minimal surfaces in convex domains do not stick to the boundary of the domain, hence examples of stickiness can be obtained only by removing the…

We develop a numerical method for the computation of a minimal convex and compact set, $\mathcal{B}\subset\mathbb{R}^N$, in the sense of mean width. This minimisation is constrained by the requirement that $\max_{b\in\mathcal{B}}\langle b ,…

Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number…

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…

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…

We give an overview of theoretical and practical aspects of finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of n points in the plane. Both problems are known to be NP-hard and were the…

This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…

The aim of this study is to analyze the properties of harmonic fields in the vicinity of rough boundaries where either a constant potential or a zero flux is imposed, while a constant field is prescribed at an infinite distance from this…

This paper introduces a new extragradient-type algorithm for a class of nonconvex-nonconcave minimax problems. It is well-known that finding a local solution for general minimax problems is computationally intractable. This observation has…