arXiv (All)
open access
Halpern-Accelerated Majorized ADMM with Optimal Non-Ergodic Convergence under Degenerate Preconditioning
We develop a Halpern-accelerated majorized alternating direction method of multipliers (ADMM) with possibly indefinite proximal terms for linearly constrained convex composite optimization. Majorization simplifies the subproblems but introduces a forward perturbation to the standard degenerate proxi
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
- ADMM and Linearized ADMM for Weakly Convex Minimization#1000133
- Polyak-Type Extragradient Methods for Monotone Root-Finding Problems#1062470
- Polyak-Type Extragradient Methods for Monotone Root-Finding Problems#1043098
- A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints#1122944
- Structural Packing and Dyadic Factorization of Sparse Positive Definite Matrices#798603
Record · ID 1143409
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