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.

168,657 papers · 148 categories

Trend · papers per month

3376741,0111,348 · Jun 202019922001200920172026
48 results for interior point method

Develops a first-order interior-point method for solving constrained variational inequalities.

problem Solving constrained variational inequalities with nontrivial constraints.
method ADMM-based interior-point method for constrained VIs (ACVI).
result First-order interior-point method with global convergence guarantees for general cVI problems.

New method solves optimization problems with stochastic objectives and constraints.

problem Optimization problems with stochastic objectives and deterministic constraints.
method Trust-region interior-point stochastic sequential quadratic programming (TR-IP-SSQP) method.
result Global almost-sure convergence to first-order stationary points under standard assumptions.

This paper reverses a construction by merging boundary critical points into an interior one.

problem Pushing interior critical points to the boundary and splitting them into two boundary points.
method Specific assumptions allow merging two boundary critical points into one interior critical point.
result Merging two boundary critical points into a single interior critical point.

In this paper, we study reinforcement learning (RL) algorithms to solve real-world decision problems with the objective of maximizing the long-term reward as well as satisfying cumulative constraints. We propose a novel first-order policy optimization method, Interior-point Policy Optimization (IPO), which augments the…

2019-10-21abs ↗pdf ↗

Interior-point methods adapted for manifolds, achieving similar optimization results.

problem Optimizing on manifolds with self-concordant barriers.
method Generalization of self-concordance to Riemannian manifolds, path-following method analysis.
result Local quadratic convergence of Newton's method and standard complexity guarantees.

IPMs struggle with hyperbolic spaces due to polynomially growing barrier parameters.

problem IPMs' efficiency is hindered in hyperbolic spaces.
method Analyzing the barrier parameter growth in hyperbolic and Hadamard spaces.
result The barrier parameter grows polynomially with the domain's diameter in hyperbolic spaces.

The study confirms conjectures about normals to convex polytopes in 3D space.

problem Concurrent normals problem for convex polytopes in 3D.
method Analyzes the PL concurrent normals problem for convex polytopes, proving conjectures for specific cases.
result Polytopes in 3D have points with 10 normals from interior points, confirmed for all tetrahedra and triangular prisms.

The paper trains neural networks with robustness guarantees using semidefinite constraints.

problem Training neural networks with robustness and stability guarantees.
method Exploiting the banded structure of semidefinite constraints, an efficient and scalable training scheme based on interior point methods is set up.
result The method allows for enforcing Lipschitz constraints in large-scale deep neural networks, as demonstrated in numerical examples.

Many problems in statistical learning, imaging, and computer vision involve the optimization of a non-convex objective function with singularities at the boundary of the feasible set. For such challenging instances, we develop a new interior-point technique building on the Hessian-barrier algorithm recently introduced …

2019-11-04abs ↗pdf ↗

Study on abnormal curves in sub-Riemannian manifolds, proving length-minimizing properties.

problem Characterizing abnormal geodesics in sub-Riemannian manifolds.
method Analyzing curves that annihilate Lie brackets and proving minimization properties.
result Strictly abnormal geodesics can cease to be locally length-minimizing.

We study Hessian fully nonlinear uniformly elliptic equations and show that the second derivatives of viscosity solutions of those equations (in 12 or more dimensions) can blow up in an interior point of the domain. We prove that the optimal interior regularity of such solutions is no more than C^{1+ε}, showing the opt…

2008-05-17abs ↗pdf ↗

Graph neural networks improve solving linear optimization problems.

problem Improving the efficiency of solving linear optimization problems.
method Using graph neural networks to simulate standard interior-point methods for linear optimization problems.
result Graph neural networks can solve linear optimization problems close to optimality, often outperforming conventional solvers.

The paper finds curves minimizing elastic energy pinned at endpoints.

problem Finding curves that minimize elastic energy with fixed endpoints.
method Applying the shooting method to identify and classify critical points.
result Critical points consist of wavelike elasticae, and minimizers have no loops or interior inflection points.

The paper examines how to protect LASSO-based feature selection from adversarial attacks.

problem Adversarial attacks on LASSO-based feature selection.
method Formulated as a bi-level optimization problem, reformulated LASSO with linear inequality constraints, solved using interior-point method, and modified using projected gradient descent.
result Demonstrated the effectiveness of the proposed method in protecting LASSO-based feature selection from adversarial attacks.

In this paper we construct examples of CRCR deformations of Lorentzian hypersurfaces which are CRCR embeddable at all points outside an arbitrarily small compact set whose interior contains a point where CRCR embeddablity is not possible.

2017-07-10abs ↗pdf ↗

Study optimal semi-static hedging for illiquid markets using dynamic cash and static quoted derivatives.

problem Optimal pricing of exotic derivatives in illiquid markets with bid-ask spreads.
method Use Galerkin method and integration quadratures to approximate hedging problem as convex optimization, solved by interior point method.
result Semi-static hedging improves pricing and reduces transaction costs compared to static or dynamic trading alone.

A novel one-class classifier fusion method for robust anomaly detection.

problem Fundamental challenges in ensemble-based anomaly detection.
method Locally adaptive learning with dynamic ℓp-norm constraints and interior-point optimization.
result Significantly improved computational efficiency and superior performance across diverse anomaly types.

The first result is the semicontinuity of automorphism groups for the collection of complex two-dimensional bounded pseudoconvex domains with smooth boundary of finite D'Angelo type. The method of proof is new so that it simplifies the previous proof of earlier semicontinuity theorems on bounded strongly pseudoconvex d…

2013-06-14abs ↗pdf ↗

Study geodesics in sub-Riemannian manifolds, resolving open questions.

problem Understanding geodesics in sub-Riemannian geometry, especially those that lose regularity.
method Constructing examples and using a lifting procedure.
result Existence of non-smooth and branching minimizing geodesics in real-analytic sub-Riemannian manifolds and Carnot groups.

For a Jordan domain in the plane the length metric space of points connected to an interior point by a curve of finite length is a CAT(0)space and Gromov hyperbolic. With respect to the cone topology, that space plus its boundary at infinity is topologically the same as the original Jordan domain.

2005-12-28abs ↗pdf ↗

Study infinitesimal characters on semi-groups to prove interior properties and apply to Teichmüller spaces.

problem Properties of infinitesimal characters and their applications in Teichmüller spaces.
method Analyzing integrable tangent vectors on character varieties and applying to pressure forms and Teichmüller spaces.
result Non-empty interior of the cone of Jordan variations and length-normalized variations for split groups.

We provide a direct proof of a non-collapsing estimate for compact hypersurfaces with positive mean curvature moving under the mean curvature flow: Precisely, if every point on the initial hypersurface admits an interior sphere with radius inversely proportional to the mean curvature at that point, then this remains tr…

2011-08-01abs ↗pdf ↗

Given a convex set and an interior point close to the boundary, we prove the existence of a supporting hyperplane whose distance to the point is controlled, in a dimensionally quantified way, by the thickness of the convex set in the orthogonal direction. This result has important applications in the regularity theory …

2011-07-06abs ↗pdf ↗

We develop a structure theory for RCD spaces with curvature bounded above in Alexandrov sense. In particular, we show that any such space is a topological manifold with boundary whose interior is equal to the set of regular points. Further the set of regular points is a smooth manifold and is geodesically convex. Aroun…

2019-08-19abs ↗pdf ↗

In this paper we consider the problem of minimizing the relative perimeter under a volume constraint in the interior of a convex body, i.e., a compact convex set in Euclidean space with interior points. We shall not impose any regularity assumption on the boundary of the convex set. Amongst other results, we shall prov…

2013-02-19abs ↗pdf ↗

Study min-max theory for hypersurfaces with boundary constraints.

problem Finding minimal hypersurfaces with boundary constraints.
method Schoen-Simon-type regularity result for integral varifolds, proving existence of closed hypersurfaces with specific properties.
result Existence of a closed C1,1C^{1,1} hypersurface with codimension 7\geq 7 singular set in the interior.

We study the Birman exact sequence for compact 33--manifolds, obtaining a complete picture of the relationship between the mapping class group of the manifold and the mapping class group of the submanifold obtained by deleting an interior point. This covers both orientable manifolds and non-orientable ones.

2014-04-14abs ↗pdf ↗

Estimates for special Lagrangian curvature equations in critical and convex cases.

problem Interior estimates for special Lagrangian curvature equations.
method Establishes a priori interior curvature and gradient estimates.
result Proves interior curvature and gradient estimates for special Lagrangian curvature equations.

Develops consistent approximations for composite optimization problems.

problem Significant errors in solutions due to approximations in optimization problems.
method Specifies conditions for well-behaved approximations in minimizers, stationary points, and level-sets for a broad class of composite problems.
result Framework of consistent approximations for composite problems, including stochastic, neural-network, and multi-objective optimization.

We consider embedded hypersurfaces evolving by fully nonlinear flows in which the normal speed of motion is a homogeneous degree one, concave or convex function of the principal curvatures, and prove a non-collapsing estimate: Precisely, the function which gives the curvature of the largest interior sphere touching the…

2011-09-10abs ↗pdf ↗