arXiv (All)
open access
A New Inexact Manifold Proximal Linear Algorithm with Adaptive Stopping Criteria
This paper proposes a new inexact manifold proximal linear (IManPL) algorithm for solving nonsmooth, nonconvex composite optimization problems over an embedded submanifold. At each iteration, IManPL solves a convex subproblem inexactly, guided by two adaptive stopping criteria. Under the stated assu
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Verifying Well-Posedness of Linear PDEs using Convex Optimization#1012174
- A proximal linearized NEP method for composite optimization with conic and manifold constraints#1084509
- Inertial acceleration in continuous optimization : Adjusting the viscosity coefficient α and convergence to the proximal flow#202563
- Revisiting Proximal Bundle Methods: Improved Rates under H{ö}lder Smoothness#1109852
- Polyak-Type Extragradient Methods for Monotone Root-Finding Problems#1062470
Record · ID 1199690
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive