New minimal surfaces found with Cantor ends in convex domains.
problem Finding complex structures for minimal surfaces with Cantor ends.
method Proving existence of complete minimal surfaces with Cantor ends in minimally convex domains.
result Existence of a Cantor set whose complement forms a complete minimal surface.
The paper examines hyperbolicity in bounded strongly minimally convex domains in R^d.
problem Investigating hyperbolicity in bounded strongly minimally convex domains.
method Analyzing the minimal metric and Hilbert metric in convex domains.
result Every bounded strongly minimally convex domain is Gromov hyperbolic.
The study establishes curvature estimates and convexity for a specific type of minimal surfaces.
problem Curvature estimates and convexity for a particular class of minimal surfaces.
method Compactness argument and curvature estimates for a family of surfaces.
result Characterization of convexity for properly embedded minimal surfaces with specific curvature conditions.
The study proves the existence of free boundary minimal disks in convex regions.
problem Proving the existence of free boundary minimal disks in convex regions.
method Based on a multiplicity-one theorem for the free boundary Simon-Smith min-max theory.
result Existence of at least three embedded free boundary minimal disks in strictly convex domains with nonnegative Ricci curvature.
Minimal graph theorem proven for convex domains.
problem Characterizing minimal graphs over convex domains.
method Analyzing minimal surface equation solutions on convex domains.
result Minimal graphs over convex domains are linear.
A mean-convex set can be regarded as a barrier for the construction of minimal surfaces. Namely, if we are given a mean-convex set and a null-homotopic Jordan curve on its boundary, then there exists an embedded minimal disk with boundary the given curve contained in the starting mean-convex set. Does a mean-convex set…
Ricci curvature links volume convexity and minimal submanifolds.
problem Volume functional convexity and minimal submanifolds in Kaehler geometry.
method Toric Kaehler geometry and quasi-homogeneous manifolds.
result Sign of Ricci curvature correlates with volume functional convexity.
The paper proves convex bodies are minimal fillings and have Lipschitz-volume rigidity.
problem Finding minimal fillings of convex bodies.
method Analyzing integral current spaces and proving rigidity properties.
result Convex bodies are the unique minimal fillings of their boundary metrics among integral current spaces and enjoy Lipschitz-volume rigidity.
New theorem on 3-manifolds with curvature and convex boundary.
problem Understanding 3-manifolds with specific curvature and boundary properties.
method Analyzes properties of Riemannian 3-manifolds with nonnegative scalar curvature and mean-convex boundary.
result Shows flatness of certain 3-manifolds containing specific geometric objects.
Local minimizers are convex and close to Wulff shapes.
problem Finding local minimizers in anisotropic isoperimetric problems.
method Showed local minimizers are geodesically convex and small smooth perturbations of tangent Wulff shapes.
result Local minimizers are quantitatively close to Wulff shapes.
Paper tackles Santaló's convex surface problem in hyperbolic 3-space.
problem Characterize convex surfaces minimizing total mean curvature with fixed area.
method Proposes conjectural minimizer description and constructs new surface candidates.
result Establishes property of singular points of any minimizer.
Paper extends SMM to weakly convex and multi-convex surrogates for non-convex optimization.
problem Non-convex optimization with weakly convex or multi-convex surrogates.
method Stochastic majorization-minimization with proximal regularization or block-minimization.
result Convergence rates for empirical and expected losses under non-i.i.d. data.
Consider a convex domain B of space. We prove that there exist complete minimal surfaces which are properly immersed in B. We also demonstrate that if D and D' are convex domains with D bounded and the closure of D contained in D' then any minimal disk whose boundary lies in the boundary of D, can be approximated in an…
Study ancient solutions to free boundary mean curvature flow in convex manifolds.
problem Understanding ancient solutions to free boundary mean curvature flow in convex manifolds.
method Establish rigidity results and construct foliations to describe ancient solutions.
result Ancient solutions to free boundary mean curvature flow are rigid and exhaust all possibilities under certain conditions.
New algorithm for online convex minimization over integer lattice.
problem Online decision-making with nonlinear combinatorial objectives.
method Introduces online Latural-convex minimization and proposes efficient algorithms. result Tight regret bound for full information setting algorithm.
First order methods can take extremely long to find global minima of non-convex functions.
problem Finding global minimizers of non-convex functions.
method Designing a family of non-convex functions and using statistical lower bounds for parameter estimation.
result First order methods can take exponential time to converge to a global minimizer.
In this paper, we prove that every conformal minimal immersion of a compact bordered Riemann surface M into a minimally convex domain D⊂R3 can be approximated, uniformly on compacts in M˚=M∖bM, by proper complete conformal minimal immersions M˚→D. We also obtain a …
The study finds at least 2 free-boundary minimal disks in convex 3-balls.
problem Finding minimal disks in convex 3-balls.
method Combining mean curvature flow, min-max theory, and degree theory.
result Existence of at least 2 free-boundary minimal disks in convex 3-balls for generic metrics.
We prove the existence of free boundary minimal annuli inside suitably convex subsets of three-dimensional Riemannian manifolds with nonnegative Ricci curvature − including strictly convex domains of the Euclidean space R3.
We carefully study how well minimizing convex surrogate loss functions, corresponds to minimizing the misclassification error rate for the problem of binary classification with linear predictors. In particular, we show that amongst all convex surrogate losses, the hinge loss gives essentially the best possible bound, o…
Characterizes symmetric Bernoulli distributions with minimal convex sums.
problem Understanding minimal dependence among Bernoulli random vectors.
method Geometric and algebraic representations of multivariate symmetric Bernoulli distributions.
result Characterizes extremal negative dependence and builds minimal dependence copulas.
Regret minimization is a powerful tool for solving large-scale problems; it was recently used in breakthrough results for large-scale extensive-form game solving. This was achieved by composing simplex regret minimizers into an overall regret-minimization framework for extensive-form game strategy spaces. In this paper…
Study minimal freezing sets in convex digital disks.
problem Finding minimal freezing sets in convex digital disks.
method Showed how to find minimal freezing sets for convex disks in digital plane.
result Found minimal freezing sets for convex disks in digital plane.
For the minimal graph defined on a convex ring in the space form with nonnegative curvature, we obtain the regularity and the strict convexity about its level sets by the continuity method.
In this paper, we present a simple analysis of {\bf fast rates} with {\it high probability} of {\bf empirical minimization} for {\it stochastic composite optimization} over a finite-dimensional bounded convex set with exponential concave loss functions and an arbitrary convex regularization. To the best of our knowledg…
Strict convexity is essential for compact minimal surfaces in curved spaces.
problem Conditions for compact minimal surfaces in curved spaces.
method Analysis of minimal surfaces in curved manifolds with free boundaries.
result Strict convexity of the boundary is necessary for compact minimal surfaces.
Sharp estimates for Finsler metrics in convex domains.
problem Estimating distances in Finsler metrics near convex points.
method Sharp estimates for intrinsic distances of Finsler metrics.
result Characterization of k-quasi hyperbolic metric in convex geometry. Study optimizes perimeter in convex domains with anisotropic constraints.
problem Optimizing perimeter in convex domains with anisotropic constraints.
method Analytical properties, topological features, and geometric measure theory results.
result Sharp isoperimetric inequalities and existence of minimizers.
Note on minimal maps' uniqueness via singular values.
problem Uniqueness of minimal maps into \(\mathbb{R}^n\).
method Using singular values and convexity of area functional, proving local linearity of singular value vectors.
result Improved uniqueness theorem for minimal graphs.
We give a universal upper bound for the total curvature of minimizing geodesic on a convex surface in the Euclidean space.
Smooths out complex shapes into simpler forms.
problem Transforming complex shapes into simpler, smooth forms.
method Perturbing minimizing hypercones and viscosity mean convex cones into smooth, properly embedded hypersurfaces.
result Properly embedded smooth minimizing hypersurfaces and self-expanders are achieved.
In this paper we consider the problem of minimizing area subject to a volume constraint in a given convex set.
Study proves rigidity of minimal hypersurfaces in specific manifolds.
problem Proving rigidity of complete free boundary minimal hypersurfaces.
method Warped θ-bubble method, generalizing capillary surfaces. result No complete two-sided stable free boundary immersions in unit ball of R4. Study rigidity of minimal disks in specific 3-manifolds.
problem Rigidity of free boundary minimal disks in mean convex three-manifolds.
method Assuming strict stability, prove isometric neighborhoods using modified Hawking mass.
result Prove rigidity of minimal disks in specific 3-manifolds.
Optimizes CM for stochastic convex optimization with progressive precision.
problem Stochastic nature of objective function in convex optimization.
method Iterative coordinate minimization with optimal precision control.
result Order-optimal regret performance for strongly convex and nonsmooth functions.
No stable minimal submanifolds in certain conformal domains.
problem Stability of minimal submanifolds in conformal domains.
method Analyzing sectional curvatures and boundary convexity.
result No compact stable free boundary minimal submanifolds exist.
The paper solves area minimizing problems in special geometric cones.
problem Area minimizing problems in conformal cones.
method Defining NCM condition, proving existence of minimal graphs, solving in specific cones.
result Existence of minimal graphs in mean convex conformal cones.
In this paper, we give a relationship between the eigenvalues of the Hodge Laplacian and the eigenvalues of the Jacobi operator for a free boundary minimal hypersurface of a Euclidean convex body. We then use this relationship to obtain new index bounds for such minimal hypersurfaces in terms of their topology. In part…
Optimally shows the distance between perturbed convex functions and their Γ-regularizations.
problem Understanding the difference between perturbed convex functions and their Γ-regularizations.
method Analyzing the compactly supported perturbation and the Γ-regularization of a strictly convex function.
result The optimal estimate of the distance between perturbed convex functions and their Γ-regularizations is shown to be o(ε). Non-convex extremal length found in surface metrics.
problem Extremal length functions on surfaces are not always convex.
method Used harmonic maps to R-trees and minimal surfaces in Rn. result Found measured foliations with non-convex extremal length functions.
We consider the problem of minimizing the bending or elastic energy among Jordan curves confined in a given open set Ω. We prove existence, regularity and some structural properties of minimizers. In particular, when Ω is convex we show that a minimizer is necessarily a convex curve. We also provide an example of a…
Accelerates machine learning algorithms for sparse data.
problem Efficiently solving composite convex minimization problems.
method Accelerated dual-averaging primal-dual method for composite convex minimization.
result Demonstrates advantages in handling sparse data both theoretically and empirically.
Investigates convexity of minimizers under mass constraint using nonlocal perimeter and potential.
problem Convexity of minimizers under mass constraint.
method Nonlocal free energy with nonlocal perimeter and convex potential.
result Quantitative stability theorem for nonlocal free energy assuming symmetry on the potential.
We construct geometric barriers for minimal graphs in H^n xR. We prove the existence and uniqueness of a solution of the vertical minimal equation in the interior of a convex polyhedron in H^n extending continuously to the interior of each face, taking infinite boundary data on one face and zero boundary value data on …
Study finds knots with ideal length need not have smallest volume.
problem Tackles the conjecture that ideal knot length equals smallest volume.
method Measures convex hull volume of knots during length annealing.
result Identifies knots with non-ideal global minimum volume.
Gradient flow converges to a minimal convex structure.
problem Finding the minimal convex structure in hyperbolic manifolds.
method Weil-Petersson gradient vector field of renormalized volume.
result The flow converges to the structure with minimum convex core volume.
Characterizing the phase transitions of convex optimizations in recovering structured signals or data is of central importance in compressed sensing, machine learning and statistics. The phase transitions of many convex optimization signal recovery methods such as ℓ1 minimization and nuclear norm minimization are…
The paper solves reverse isoperimetric problems for convex bodies with curvature constraints.
problem Finding the smallest volume among λ-convex bodies of a given surface area. method Using λ-convex bodies and analyzing their properties in model spaces of constant curvature. result The λ-convex lens is the unique minimizer of volume among all λ-convex bodies of given surface area in R3.