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

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

Incremental Gradient, Subgradient, and Proximal Methods for Convex Optimization: A Survey

Open access
Bertsekas, Dimitri P.·2011·Optimization for Machine Learning

Abstract

We survey incremental methods for minimizing a sum $\sum_{i=1}^mf_i(x)$ consisting of a large number of convex component functions $f_i$. Our methods consist of iterations applied to single components, and have proved very effective in practice. We introduce a unified algorithmic framework for a variety of such methods, some involving gradient and subgradient iterations, which are known, and some involving combinations of subgradient and proximal methods, which are new and offer greater flexibility in exploiting the special structure of $f_i$. We provide an analysis of the convergence and rate of convergence properties of these methods, including the advantages offered by randomization in the selection of components. We also survey applications in inference/machine learning, signal processing, and large-scale and distributed optimization.

Overview

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.7551/mitpress/8996.003.0006

Cites

72 of 72 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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 72 references

Cited by

See all 381

Metadata

Authors
Bertsekas, D. P.
Venue
Optimization for Machine Learning
Publisher
The MIT Press
Published
2011-09-30
Pages
85-120
OpenAlex
W2134130436
Cited by
381
References
72
FWCI
58.40
Type
book chapter
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: Incremental Gradient, Subgradient, and Proximal Methods for Convex Optimization: A Survey. https://app.cochat.ai/papers/10.7551/mitpress/8996.003.0006
The paper
Bertsekas, D. P. (2011). Incremental Gradient, Subgradient, and Proximal Methods for Convex Optimization: A Survey. Optimization for Machine Learning. https://doi.org/10.7551/mitpress/8996.003.0006

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.