Journal article · 2013

Block splitting for distributed optimization

Neal Parikh, Stephen Boyd

Mathematical Programming Computation, 6(1), 77–102 · Published 26 October 2013 · DOI 10.1007/s12532-013-0061-8

View at the publisherCite this paper

In brief

“Block splitting for distributed optimization” is a 2013 journal article by Neal Parikh and Stephen Boyd, published in Mathematical Programming Computation. OpenAlex counts 111 citations as of 15 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
111
Most cited in
2017 (16)
Field-weighted impact
11.12
References
33
Authors
2

Cite this paper

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

APA 7

Parikh, N., & Boyd, S. (2013). Block splitting for distributed optimization. Mathematical Programming Computation, 6(1), 77–102. https://doi.org/10.1007/s12532-013-0061-8

MLA 9

Parikh, Neal, and Stephen Boyd. “Block splitting for distributed optimization.” Mathematical Programming Computation, vol. 6, no. 1, 2013, pp. 77–102. https://doi.org/10.1007/s12532-013-0061-8.

Chicago

Parikh, Neal and Stephen Boyd. 2013. “Block splitting for distributed optimization.” Mathematical Programming Computation 6 (1): 77–102. https://doi.org/10.1007/s12532-013-0061-8.

Harvard

Parikh, N. and Boyd, S. (2013) ‘Block splitting for distributed optimization’, Mathematical Programming Computation, 6(1), pp. 77–102. doi:10.1007/s12532-013-0061-8.

IEEE

N. Parikh and S. Boyd, “Block splitting for distributed optimization,” Mathematical Programming Computation, vol. 6, no. 1, pp. 77–102, 2013, doi: 10.1007/s12532-013-0061-8.

BibTeX

@article{parikh2013block,
  title     = {{Block splitting for distributed optimization}},
  author    = {Parikh, Neal and Boyd, Stephen},
  journal   = {Mathematical Programming Computation},
  year      = {2013},
  volume    = {6},
  number    = {1},
  pages     = {77--102},
  doi       = {10.1007/s12532-013-0061-8},
  url       = {https://doi.org/10.1007/s12532-013-0061-8}
}

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

Citations by year

YearCitationsShare of the best year
20171616
20181414
20191212
202088
202166
202244
202322
20241111
202533
202622

Its field-weighted citation impact is 11.12: it has been cited 11.12 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis

  • distributed optimization
  • block splitting
  • Douglas-Rachford splitting
  • alternating direction method of multipliers
  • convex optimization
  • logistic regression
  • support vector machine
  • LASSO

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?

Parikh, N., & Boyd, S. (2013). Block splitting for distributed optimization. Mathematical Programming Computation, 6(1), 77–102. https://doi.org/10.1007/s12532-013-0061-8

How many times has this paper been cited?

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

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Neal Parikh, Stephen Boyd.

What is the DOI of this paper?

10.1007/s12532-013-0061-8. The permanent link is https://doi.org/10.1007/s12532-013-0061-8.

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