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

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

Coordinate descent algorithms

Wright, Stephen J. · 2015 · Mathematical Programming

Abstract

Coordinate descent algorithms solve optimization problems by successively performing approximate minimization along coordinate directions or coordinate hyperplanes. They have been used in applications for many years, and their popularity continues to grow because of their usefulness in data analysis, machine learning, and other areas of current interest. This paper describes the fundamentals of the coordinate descent approach, together with variants and extensions and their convergence properties, mostly with reference to convex objectives. We pay particular attention to a certain problem structure that arises frequently in machine learning applications, showing that efficient implementations of accelerated coordinate descent algorithms are possible for problems of this type. We also present some parallel variants and discuss their convergence properties under several models of parallel execution.

Overview

Integrity signals

Registry

Crossref · 10.1007/s10107-015-0892-3

Cites

59 of 59 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 63 references

Research works printed but not linked: 5

  1. Bradley, J.K., Kyrola, A., Bickson, D., Guestrin, C.: Parallel coordunate descent for $$\ell _1$$ ℓ 1 -regularized loss minimization. In: Proceedings of the 28 International Conference on Machine Learning (ICML 2011) (2011)
  2. Kaczmarz, S.: Angenäherte auflösung von systemen linearer gleichungen. Bulletin International de l’Academie Polonaise des Sciences et des Lettres 35, 355–357 (1937)
  3. Lin, Q., Lu, Z., Xiao, L.: An accelerated proximal coordinate gradient method and its application to empirical risk minimization. Technical Report, Microsoft Research (2014). arXiv:1407.1296 · arXiv
  4. Liu, J., Wright, S.J., Ré, C., Bittorf, V., Sridhar, S.: An asynchronous parallel stochastic coordinate descent algorithm. Technical Report, Computer Sciences Department, University of Wisconsin-Madison (2013). (To appear in Journal of Machine Learning Research). arXiv:1311.1873 · arXiv
  5. Nesterov, Y.: A method for unconstrained convex problem with the rate of convergence $$O(1/k^2)$$ O ( 1 / k 2 ) . Doklady AN SSSR 269, 543–547 (1983)

Cited by

See all 1,438

Metadata

Authors
Wright, S. J.
Affiliations
University of Wisconsin–Madison (US)
Corresponding author
Wright, Stephen J.
Venue
Mathematical Programming
Published
2015-03-25
Volume
151
Issue
1
Pages
3-34
ISSN
  • 0025-5610 (ISSN-L)
  • 1436-4646
OpenAlex
W2000769684
Cited by
1,438
References
63
Citations by year
2026: 116 · 2025: 130 · 2024: 136 · 2023: 125 · 2022: 141 · 2021: 178 · 2020: 174 · 2019: 156 · 2018: 125 · 2017: 94 · 2016: 50 · 2015: 10
FWCI
91.18
Type
journal article
Language
en
Open access
closed
Licence
www.springer.com/tdm (tdm)
Locations
Mathematical Programming (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
Keywords
coordinate descent, convex optimization, convergence analysis, parallel coordinate descent, machine learning optimization

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: Coordinate descent algorithms. https://app.cochat.ai/papers/10.1007/s10107-015-0892-3
The paper
Wright, S. J. (2015). Coordinate descent algorithms. Mathematical Programming. https://doi.org/10.1007/s10107-015-0892-3

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.