arXiv (All)
open access
A Safeguarded Accelerated Proximal ADMM Algorithm for Solving Structured Cardinality Penalized Optimization Problems
This paper considers a class of structured cardinality penalized optimization problems with nonsmooth convex loss functions, for which the proximal mapping associated with the structured $\ell_0$ penalty is generally unavailable. To overcome this difficulty, we develop a chain of exact reformulation
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
- Discrete eigenvalue optimization from entropic smoothing and first-order methods#820645
- Interior-point proximal methods for nonsmooth optimization in Hilbert spaces with cone-ordered constraints#1083310
- Policy evaluation and learning with partially identified utility under truncation by death#1143384
- Constrained Differentiable Policy Learning for Safe Quadrotor Navigation#1327709
- Learning Context-Free Grammars for Grammar-Constrained Decoding via Declarative Agentic Programming with Guarantees#432608
Record · ID 1325455
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