arXiv (All)
open access
Convergence Analyses of Davis-Yin Splitting via Scaled Relative Graphs II: Convex Optimization Problems
The prior work of [SIAM J. Optim., 2025] used scaled relative graphs (SRG) to analyze the convergence of Davis--Yin splitting (DYS) iterations on monotone inclusion problems. In this work, we use this machinery to analyze DYS iterations on convex optimization problems and obtain state-of-the-art lin
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
- Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities#1110716
- Right Bregman proximal gradient with application to Poisson inverse problems *#1215677
- An infeasible interior-point algorithm for solving primal and dual geometric programs#429971
- A splitting proximal method in portfolio optimization with entropic value-at-risk#1325260
- Multi-split Multiple-sets Implicit Convex Feasibility Seeking As Split Inverse Problems#1491599
Record · ID 1533822
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