Pith. sign in

REVIEW 2 cited by

Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization

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

arxiv 1109.2415 v2 pith:6CSU53FV submitted 2011-09-12 cs.LG math.OC

Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization

classification cs.LG math.OC
keywords proximal-gradientconvexratesconvergenceerrorfunctionmethodmethods
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We consider the problem of optimizing the sum of a smooth convex function and a non-smooth convex function using proximal-gradient methods, where an error is present in the calculation of the gradient of the smooth term or in the proximity operator with respect to the non-smooth term. We show that both the basic proximal-gradient method and the accelerated proximal-gradient method achieve the same convergence rate as in the error-free case, provided that the errors decrease at appropriate rates.Using these rates, we perform as well as or better than a carefully chosen fixed error level on a set of structured sparsity problems.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. The iterates of FISTA converge even under inexact computations and stochastic gradients

    math.OC 2025-11 conditional novelty 6.0

    Weak (and almost-sure weak) convergence of inexact and stochastically noised FISTA iterates in infinite-dimensional Hilbert spaces, with O(1/t_k^2)-type objective rates.

  2. Multilevel Preconditioning Strategies for Convex Optimization Methods in Image Deblurring

    math.NA 2026-07 conditional novelty 5.5

    Preconditioning plus multilevel V-cycles accelerates both exact and inexact proximal gradient methods for regularized image deblurring while preserving reconstruction quality.