arXiv (All)
open access
An accelerated proximal PRS-SQP algorithm with dual ascent-descent procedures for smooth composite optimization
Conventional wisdom in composite optimization suggests augmented Lagrangian dual ascent (ALDA) in Peaceman-Rachford splitting (PRS) methods for dual feasibility. However, ALDA may fail when the primal iterate is a local minimum, a stationary point, or a coordinatewise solution of the highly nonconve
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
- Accelerated Bregman Proximal Gradient Methods from Dual Geometric Perspectives#1129394
- High-Probability Polynomial-Time Complexity of Restarted PDHG for Linear Programming#987399
- Revisiting Proximal Bundle Methods: Improved Rates under H{ö}lder Smoothness#1109852
- Variable Stepsize Distributed Forward-Backward Splitting Methods as Relocated Fixed-Point Iterations#1052079
- Convergence Rate Analysis for Monotone Accelerated Proximal Gradient Method#629792
Record · ID 1131393
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