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

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

Global convergence of the Heavy-ball method for convex optimization

Ghadimi, Euhanna, Feyzmahdavian, Hamid Reza, Johansson, Mikael·2015·2015 European Control Conference (ECC)

Abstract

This paper establishes global convergence and provides global bounds of the rate of convergence for the Heavy-ball method for convex optimization. When the objective function has Lipschitz-continuous gradient, we show that the Cesáro average of the iterates converges to the optimum at a rate of O(1/k) where k is the number of iterations. When the objective function is also strongly convex, we prove that the Heavy-ball iterates converge linearly to the unique optimum. Numerical examples validate our theoretical findings.

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.1109/ecc.2015.7330562

Cites

4 of 4 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 4 references

Cited by

See all 240

Metadata

Authors
Ghadimi, E., Feyzmahdavian, H. R., & Johansson, M.
Venue
2015 European Control Conference (ECC)
Publisher
IEEE
Published
2015-07
Pages
310-315
OpenAlex
W2137731592
Cited by
240
References
4
FWCI
14.54
Type
conference paper
Language
en
Open access
closed

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: Global convergence of the Heavy-ball method for convex optimization. https://app.cochat.ai/papers/10.1109/ecc.2015.7330562
The paper
Ghadimi, E., Feyzmahdavian, H. R., & Johansson, M. (2015). Global convergence of the Heavy-ball method for convex optimization. 2015 European Control Conference (ECC). https://doi.org/10.1109/ecc.2015.7330562

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.