arXiv (All)
open access
An Infeasible Method with Feasibility Safeguard for Nonsmooth Composite Optimization Over Manifolds
We study nonsmooth composite optimization over embedded submanifolds defined by nonlinear equality constraints. We propose a feasibility-safeguarded inexact proximal linearized method whose iterations require neither projection nor retraction onto the manifold. A computable smooth-dual residual cert
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
- Riemannian ascent--descent for nonconvex nonconcave minimax landscapes: convergence to basin saddle points and applications to distributionally robust optimization#1083611
- Robust stability and preconditioning of Darcy-Forchheimer equations#987492
- Efficient Optimization on the Euclidean Sphere: Riemannian Gradient Alignment as a Unifying Principle#984625
- Gradient descent avoids strict saddles with a simple line-search method too#1061612
- Verified Linear Programming through Tolerance-Aware Precision Boosting#1070495
Record · ID 1389301
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