Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920182026
48 results for minimization problems

Recent results in Compressive Sensing have shown that, under certain conditions, the solution to an underdetermined system of linear equations with sparsity-based regularization can be accurately recovered by solving convex relaxations of the original problem. In this work, we present a novel primal-dual analysis on a …

2012-01-18abs ↗pdf ↗

Paper shows non-existence of solutions for minimal surface problems.

problem Non-existence of solutions to Dirichlet problems for minimal surfaces.
method Analyzes minimal graphs of codimension ≥2 over domains with possibly non-C1C^1 boundaries.
result Proves non-existence of solutions in various scenarios.

Study on elastic curves pinned at the boundary, focusing on minimizers and their interaction with obstacles.

problem Minimizing elastic bending energy for open planar curves with obstacles.
method Investigation of global minimizers and explicit solutions for different values of the penalization parameter.
result Explicit threshold for λλ above which minimizers touch the obstacle, regardless of obstacle shape.

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.

Proves existence and uniqueness of solutions for a specific minimal surface equation.

problem Existence and uniqueness of solutions for a singular minimal surface equation.
method Proves existence and uniqueness of classical solutions for the Dirichlet problem.
result Proves existence and uniqueness of solutions for the αα-singular minimal surface equation.

Study determines minimal surfaces from boundary data, proving topological and conformal recoverability.

problem Determining minimal surfaces from boundary data.
method Developed a semiclassical nonlinear calculus for complex geometric optics solutions.
result Minimal surfaces can be recovered from the Dirichlet-to-Neumann map under certain conditions.

Study on minimal submanifolds in curved spaces with unique solution to asymptotic Plateau problem.

problem Minimal submanifolds in negatively curved spaces with small curvature.
method Analysis of spheres at infinity and asymptotic Plateau problem.
result Complete minimal submanifolds bound a class of spheres with uniquely solvable asymptotic Plateau problem.

Solves a Cauchy problem for minimal spacelike surfaces in 4D spacetime.

problem Constructing minimal spacelike surfaces in 4D spacetime.
method Defining isoclinic parametric surfaces and proving their relation to holomorphic functions, solving the Cauchy problem.
result Solves the Cauchy problem for minimal spacelike surfaces in R24\mathbb{R}^4_2.

We investigate the minimal surface problem in the three dimensional Heisenberg group, H, equipped with its standard Carnot-Caratheodory metric. Using a particular surface measure, we characterize minimal surfaces in terms of a sub-elliptic partial differential equation and prove an existence result for the Plateau prob…

2001-08-07abs ↗pdf ↗

Minimal surfaces in Heisenberg group solved via Dirichlet problems.

problem Existence of minimal surfaces in Heisenberg group with balanced metric.
method Solving Dirichlet problems for minimal surface equation.
result Existence of complete properly embedded minimal surfaces.

Study on minimal surfaces in a specific homogeneous space with non-existence and construction results.

problem Minimal surfaces in SL~2(R){\widetilde{\mathrm{SL}}_2(\mathbb{R})} with asymptotic boundary conditions.
method Non-existence proofs and construction of specific minimal surfaces.
result Existence and non-existence results for minimal surfaces in SL~2(R){\widetilde{\mathrm{SL}}_2(\mathbb{R})}.

Paper proposes a new method to minimize submodular functions with fewer calls to simpler oracles.

problem Minimizing the sum of submodular set functions with limited information.
method Introduces a modified convex problem requiring constrained total variation oracles that can be solved with fewer calls to minimization oracles.
result Shows significant reduction in the number of calls to minimization oracles.

New algorithms improve submodular minimization via DC programming.

problem Minimizing the difference of two submodular functions.
method Introducing variants of the DC algorithm (DCA) and its complete form (CDCA) for DC programs corresponding to DS minimization.
result Our algorithms outperform existing baselines on speech corpus selection and feature selection.

New method estimates robust mean in high dimensions with minimized outliers.

problem Estimating the mean in high dimensions when a fraction of data is corrupted.
method Formulating the problem as 0\ell_0-norm minimization under second moment constraints, and using 1\ell_1 and p\ell_p minimization techniques.
result The proposed method achieves order optimal robust mean estimation and significantly outperforms existing methods.

We give a fairly complete solution to the asymptotic Plateau Problem for area minimizing surfaces in H2xR. In particular, we identify the collection of Jordan curves in the asymptotic boundary of H2xR, which bounds an area minimizing surface in H2xR. Furthermore, we study the similar problem for minimal surfaces, and s…

2016-04-06abs ↗pdf ↗

Paper connects minimal and maximal surfaces' boundary value problems.

problem Existence and uniqueness of minimal surfaces' boundary value problems.
method One-to-one correspondence between minimal and maximal surfaces' solutions.
result One-to-one correspondence between minimal and maximal surfaces' boundary value problems.

Study determines a minimal surface in a Riemannian manifold from boundary data.

problem Determining a minimal surface in a Riemannian manifold from boundary data.
method Analyzes the Dirichlet-to-Neumann map for the minimal surface equation.
result Knowledge of the Dirichlet-to-Neumann map determines the Riemannian manifold up to isometry.

Extends Newton's minimal resistance problem to Lorentz-Minkowski space.

problem Minimal resistance in Lorentz-Minkowski space.
method Derived functional energy, determined Euler-Lagrange equation, analyzed maximum principle, found separable and radial solutions.
result Obtained solutions with conical singularities at the origin and analyzed the Single Shock Condition.

Study proves conditions for area-minimizing surfaces in a specific space.

problem Existence and non-existence of area-minimizing surfaces in E(1,τ)\mathbb{E}(-1,τ).
method Analyzes sufficient conditions for curves to be the asymptotic boundary of area-minimizing surfaces.
result Presented sufficient conditions for a curve to admit a solution to the asymptotic Plateau problem.

New limits of minimal surface systems have surprising large interior parts.

problem Minimal surface system limits with large interior vertical and non-minimal portions.
method Construction of limits with smallest possible dimension and codimension.
result Limits of minimal surface systems can have surprising large interior parts.

Euler's elastica with monotone curvature is uniquely minimal.

problem Global minimality of planar elastica with monotone curvature.
method Proof of global minimality using clamped boundary conditions and length penalization.
result Every planar elastica with non-constant monotone curvature is uniquely minimal.

A meta-learning approach improves the performance of alternating minimization for non-convex optimization problems.

problem Optimizing non-convex problems with multiple variables using alternating minimization.
method Meta-learning based alternating minimization (MLAM) to replace handcrafted updating rules.
result The proposed MLAM method outperforms traditional AM-based methods in various non-convex optimization problems.