arXiv (All)
open access
An inexact variable metric proximal linearization method for composite optimization on manifolds
This paper concerns the minimization of the composition of a nonsmooth convex function and a $\mathcal{C}^{1,1}$ mapping $F$ over a $\mathcal{C}^2$-smooth embedded closed submanifold $\mathcal{M}$. For this class of nonconvex and nonsmooth problems, we propose an inexact variable metric proximal lin
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
- Envelopt: Constrained Convex Composite Optimization#1077449
- Efficient Parameter-Free First-Order Methods for Nonsmooth Composite Minimax Optimization#1061385
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms#144202
- Norm-Cone Conjugation for Nonconvex Optimization: Scalar Duality and Exact Distance Penalization#1109103
- Dual characterizations of norm minimization problems#998079
Record · ID 1156203
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