arXiv (OAI Expanded)
open access
Revisiting Proximal Bundle Methods: Improved Rates under H{ö}lder Smoothness
Proximal bundle methods (PBMs) are classical algorithms for nonsmooth convex optimization. Existing analyses of the classical PBM couple the null steps with the descent test. This coupling obscures how the bundle updates approximate the proximal subproblem. In this work, we consider composite object
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
- An accelerated proximal PRS-SQP algorithm with dual ascent-descent procedures for smooth composite optimization#1131393
- Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization#677562
- Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization#674363
- Effective curvature dimension in smooth DC optimization#1064922
- A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints#1122944
Record · ID 1109852
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