Preprint · 2012 · Open access

Scaling Up Coordinate Descent Algorithms for Large $\ell_1$ Regularization Problems

Scherrer, Chad, Mahantesh M. Halappanavar, Ambuj Tewari, David J. Haglin

arXiv (Cornell University), 355–362 · Published 27 June 2012 · DOI 10.48550/arxiv.1206.6409

Free PDFView at the publisherCite this paper

In brief

“Scaling Up Coordinate Descent Algorithms for Large $\ell_1$ Regularization Problems” is a 2012 preprint by Scherrer, Chad and 3 co-authors, published in arXiv (Cornell University). OpenAlex counts 23 citations as of 16 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
23
Most cited in
2014 (6)
References
23
Authors
4

Abstract

We present a generic framework for parallel coordinate descent (CD) algorithms that includes, as special cases, the original sequential algorithms Cyclic CD and Stochastic CD, as well as the recent parallel Shotgun algorithm. We introduce two novel parallel algorithms that are also special cases---Thread-Greedy CD and Coloring-Based CD---and give performance measurements for an OpenMP implementation of these.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Chad, S., Halappanavar, M. M., Tewari, A., & Haglin, D. J. (2012). Scaling Up Coordinate Descent Algorithms for Large $\ell_1$ Regularization Problems. arXiv (Cornell University), 355–362. https://doi.org/10.48550/arxiv.1206.6409

MLA 9

Chad, Scherrer,, et al. “Scaling Up Coordinate Descent Algorithms for Large $\ell_1$ Regularization Problems.” arXiv (Cornell University), 2012, pp. 355–362. https://doi.org/10.48550/arxiv.1206.6409.

Chicago

Chad, Scherrer,, Mahantesh M. Halappanavar, Ambuj Tewari, and David J. Haglin. 2012. “Scaling Up Coordinate Descent Algorithms for Large $\ell_1$ Regularization Problems.” arXiv (Cornell University): 355–362. https://doi.org/10.48550/arxiv.1206.6409.

Harvard

Chad, S. et al. (2012) ‘Scaling Up Coordinate Descent Algorithms for Large $\ell_1$ Regularization Problems’, arXiv (Cornell University), pp. 355–362. doi:10.48550/arxiv.1206.6409.

IEEE

S. Chad, M. M. Halappanavar, A. Tewari, and D. J. Haglin, “Scaling Up Coordinate Descent Algorithms for Large $\ell_1$ Regularization Problems,” arXiv (Cornell University), pp. 355–362, 2012, doi: 10.48550/arxiv.1206.6409.

BibTeX

@misc{chad2012scaling,
  title     = {{Scaling Up Coordinate Descent Algorithms for Large \$\ell\_1\$ Regularization Problems}},
  author    = {Chad, Scherrer, and Halappanavar, Mahantesh M. and Tewari, Ambuj and Haglin, David J.},
  howpublished = {arXiv (Cornell University)},
  year      = {2012},
  pages     = {355--362},
  doi       = {10.48550/arxiv.1206.6409},
  url       = {https://doi.org/10.48550/arxiv.1206.6409}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201322
201466
201666
201733
201811
201933
202011
202611

Topic and keywords

Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques

  • parallel coordinate descent
  • L1 regularization
  • cyclic coordinate descent
  • graph coloring
  • OpenMP
  • large-scale optimization
  • distributed optimization

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Chad, S., Halappanavar, M. M., Tewari, A., & Haglin, D. J. (2012). Scaling Up Coordinate Descent Algorithms for Large $\ell_1$ Regularization Problems. arXiv (Cornell University), 355–362. https://doi.org/10.48550/arxiv.1206.6409

How many times has this paper been cited?

23 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access: read the free full text at arXiv (Cornell University).

Who wrote this paper?

Scherrer, Chad, Mahantesh M. Halappanavar, Ambuj Tewari, David J. Haglin.

What is the DOI of this paper?

10.48550/arxiv.1206.6409. The permanent link is https://doi.org/10.48550/arxiv.1206.6409.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.