Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 267

The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.

Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods

Open access
Drusvyatskiy, Dmitriy, Lewis, Adrian S. · 2018 · Mathematics of Operations Research

Abstract

The proximal gradient algorithm for minimizing the sum of a smooth and nonsmooth convex function often converges linearly even without strong convexity. One common reason is that a multiple of the step length at each iteration may linearly bound the “error”—the distance to the solution set. We explain the observed linear convergence intuitively by proving the equivalence of such an error bound to a natural quadratic growth condition. Our approach generalizes to linear and quadratic convergence analysis for proximal methods (of Gauss-Newton type) for minimizing compositions of nonsmooth functions with smooth mappings. We observe incidentally that short step-lengths in the algorithm indicate near-stationarity, suggesting a reliable termination criterion.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1287/moor.2017.0889

Cites

22 of 22 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 22 references

Cited by

See all 267

Metadata

Authors
Drusvyatskiy, D., & Lewis, A. S.
Venue
Mathematics of Operations Research
Published
2018-08
Volume
43
Issue
3
Pages
919-948
ISSN
  • 0364-765X (ISSN-L)
  • 1526-5471
OpenAlex
W2278798990
Cited by
267
References
22
FWCI
23.26
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods. https://app.cochat.ai/papers/10.1287/moor.2017.0889
The paper
Drusvyatskiy, D., & Lewis, A. S. (2018). Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods. Mathematics of Operations Research. https://doi.org/10.1287/moor.2017.0889

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.