Convergence Analyses of Davis-Yin Splitting via Scaled Relative Graphs II: Convex Optimization Problems

Ernest K. Ryu; Soheun Yi

Convergence Analyses of Davis-Yin Splitting via Scaled Relative Graphs II: Convex Optimization Problems

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2211.15604 v2 pith:4MZEUZME submitted 2022-11-28 math.OC

Soheun Yi , Ernest K. Ryu This is my paper · ORCID

classification math.OC

keywords convergenceproblemsanalyzeconvexgraphsiterationsoptimizationrelative

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

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 linear convergence rates.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

The Stochastic Multi-Proximal Method for Nonsmooth Optimization
math.OC 2025-05 conditional novelty 7.0 of 10

SMPM is a stochastic multi-proximal method that recovers several existing algorithms as special cases and provides new linear and accelerated sublinear convergence guarantees for nonsmooth convex problems.

Pith tools