REVIEW 1 cited by
Tight Convergence Rate in Subgradient Norm of the Proximal Point Algorithm
Not yet reviewed by Pith; the record is open.
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
read the original abstract
Proximal point algorithm has found many applications, and it has been playing fundamental roles in the understanding, design, and analysis of many first-order methods. In this paper, we derive the tight convergence rate in subgradient norm of the proximal point algorithm, which was conjectured by Taylor, Hendrickx and Glineur [SIAM J.~Optim., 27 (2017), pp.~1283--1313]. This sort of convergence results in terms of the residual (sub)gradient norm is particularly interesting when considering dual methods, where the dual residual gradient norm corresponds to the primal distance to feasibility.
Forward citations
Cited by 1 Pith paper
-
Optimized methods for composite optimization: a reduction perspective
A reduction framework converts unconstrained optimized first-order methods into composite-setting methods with analogous rates, yielding new proximal OGM and proximal OGM-G guarantees.
Discussion (0). Continue with ORCID to comment.