arXiv (All)
open access
A Nesterov-Accelerated Primal-Dual Splitting Algorithm for Convex Nonsmooth Optimization
We investigate the integration of Nesterov-type acceleration into primal-dual methods for structured convex optimization. While proximal splitting algorithms efficiently handle composite problems of the form $\min_x f(x) + g(x) + h(K x)$, accelerating their convergence with respect to the smooth ter
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
- Primal-dual splitting algorithms for constrained monotone inclusions#1347808
- Gradient Descent on Logistic Regression with Non-Separable Data and Large Step Sizes#821653
- Expander Hierarchies for Normalized Cuts on Graphs#163040
- An ETH-based quasipolynomial lower bound for Dualization#1248753
- Distributed semi-speculative parallel anisotropic mesh adaptation.#430804
Record · ID 1247369
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