arXiv (All)
open access
Complexities of Weak Proximal Oracle Methods for Composite Convex Optimization
We consider a standard convex composite optimization problem with either smooth or nonsmooth objective function, and under quadratic growth. In recent years, several works gave algorithms based on a \textit{weak proximal oracle} (WPO) that essentially match in oracle complexities proximal (sub)gradi
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
- Separating plane algorithms for convex optimization#429981
- Anchored Extra-Proximal Methods: Optimal Higher-Order Methods for Monotone Inclusion Problems#1078283
- Dual characterizations of norm minimization problems#998079
- Projection-Free Non-Smooth Convex Programming#1070645
- An infeasible interior-point algorithm for solving primal and dual geometric programs#429971
Record · ID 1050601
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