arXiv (All)
open access
Restarted Fixed-Point Acceleration of Proximal ADMM for Capped-$\ell_1$ Penalized Optimization
We consider box-constrained optimization with a convex, Lipschitz continuous loss function that may be nonsmooth and a capped-$\ell_1$ penalty. Exploiting the convex branch representation of the capped-$\ell_1$ penalty, we construct an associated nonexpansive fixed-point mapping for each branch and,
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
- Optimal Parameter-Free Second-order Acceleration with Inexact Hessians under Generalized Smoothness#1117689
- Isolated calmness of regularized linear inverse problems#973831
- How Much is Left? LLMs Linearly Encode Their Remaining Output Length#343470
- On the sample complexity of the active subspace method#986559
- KellyBoost: Growth-Optimal Portfolio Construction with Gradient-Boosted Trees#482124
Record · ID 1356780
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