相关论文: On the minimal distance between two surfaces

Differential completions and compactifications of differential spaces are introduced and investigated. The existence of the maximal differential completion and the maximal differential compactification is proved. A sufficient condition for…

In this work we analyze the Total Variation-Wasserstein minimization problem. We propose an alternative form of deriving optimality conditions from the approach of Calier\&Poon'18, and as result obtain further regularity for the quantities…

We consider the problem of minimizing a convex objective which is the sum of a smooth part, with Lipschitz continuous gradient, and a nonsmooth part. Inspired by various applications, we focus on the case when the nonsmooth part is a…

When matching parts of a surface to its whole, a fundamental question arises: Which points should be included in the matching process? The issue is intensified when using isometry to measure similarity, as it requires the validation of…

In this paper, we study the functional introduced by the author in collaboration with Bonnivard, Bretin, and Lemenant, which is designed to approximate Plateau's problem. We establish the existence of a minimizer and prove its H{\"o}lder…

In the setting of fractional minimal surfaces, we prove that if two nonlocal minimal sets are one included in the other and share a common boundary point, then they must necessarily coincide. This strict maximum principle is not obvious,…

We provide new general methods in the calculus of variations for the anisotropic Plateau problem in arbitrary dimension and codimension. A new direct proof of Almgren's 1968 existence result is presented; namely, we produce from a class of…

Minimal surfaces in closed 3-manifolds are classically constructed via the Almgren-Pitts approach. The Allen-Cahn approximation has proved to be a powerful alternative, and Chodosh and Mantoulidis (in Ann. Math. 2020) used it to give a new…

This paper addresses the problem of low-rank distance matrix completion. This problem amounts to recover the missing entries of a distance matrix when the dimension of the data embedding space is possibly unknown but small compared to the…

In this note we prove optimal inequalities for bounded functions in terms of their deviation from their mean. These results extend and generalize some known inequalities due to Thong (2011) and Perfetti (2011)

One revisits the standard saddle-point method based on conjugate duality for solving convex minimization problems. Our aim is to reduce or remove unnecessary topological restrictions on the constraint set. Dual equalities and…

In this manuscript we study the following optimization problem with volume constraint: \[ \min\left\{\frac{1}{p}\int_{\Omega} |\nabla v|^pdx- \int_{\partial \Omega} gv\,dS \colon v \in W^{1, p} \left(\Omega\right), \text{ and } |\{v>0\}|…

We survey some $L^{p}$-vanishing results for solutions of Bochner or Simons type equations with refined Kato inequalities, under spectral assumptions on the relevant Schr\"{o}dinger operators. New aspects are included in the picture. In…

To every nearly convex optimization problem, that is a minimization problem with a nearly convex objective function and a nearly convex constraint set, we associate a uniquely defined convex optimization problem with a lower semicontinuous…

The optimization problem concerning the determination of the minimizer for the sum of convex functions holds significant importance in the realm of distributed and decentralized optimization. In scenarios where full knowledge of the…

Given two hyperbolic surfaces and a homotopy class of maps between them, Thurston proved that there always exists a representative minimizing the Lipschitz constant. While not unique, these minimizers are rigid along a geodesic lamination.…

This paper is concerned with an optimization problem governed by the Kantorovich optimal transportation problem. This gives rise to a bilevel optimization problem, which can be reformulated as a mathematical problem with complementarity…

This work proposes a novel convex-non-convex formulation of the image segmentation and the image completion problems. The proposed approach is based on the minimization of a functional involving two distinct regularization terms: one…

We prove continuity up to the boundary of the minimizer of an obstacle problem and higher integrability of its gradient under generalized Orlicz growth. The result recovers similar results obtained in the special cases of polynomial growth,…

In this paper, we consider two variants of the concept of sharp minimum for mathematical programming problems with quasiconvex objective function and inequality constraints. It investigated the problem of describing a variant of a simple…