Book chapter · 2018 · Open access

Primal-Dual Proximal Algorithms for Structured Convex Optimization: A Unifying Framework

Puya Latafat, Panagiotis Patrinos

Lecture notes in mathematics, 97–120 · Published 1 January 2018 · DOI 10.1007/978-3-319-97478-1_5

Free PDFView at the publisherCite this paper

In brief

“Primal-Dual Proximal Algorithms for Structured Convex Optimization: A Unifying Framework” is a 2018 book chapter by Puya Latafat and Panagiotis Patrinos, published in Lecture notes in mathematics. OpenAlex counts 11 citations as of 15 November 2026. It is open access: the full text is free to read at Lirias.

Citations
11
Most cited in
2022 (4)
Field-weighted impact
3.08
References
35
Authors
2

Cite this paper

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

APA 7

Latafat, P., & Patrinos, P. (2018). Primal-Dual Proximal Algorithms for Structured Convex Optimization: A Unifying Framework. Lecture notes in mathematics, 97–120. https://doi.org/10.1007/978-3-319-97478-1_5

MLA 9

Latafat, Puya, and Panagiotis Patrinos. “Primal-Dual Proximal Algorithms for Structured Convex Optimization: A Unifying Framework.” Lecture notes in mathematics, 2018, pp. 97–120. https://doi.org/10.1007/978-3-319-97478-1_5.

Chicago

Latafat, Puya and Panagiotis Patrinos. 2018. “Primal-Dual Proximal Algorithms for Structured Convex Optimization: A Unifying Framework.” Lecture notes in mathematics: 97–120. https://doi.org/10.1007/978-3-319-97478-1_5.

Harvard

Latafat, P. and Patrinos, P. (2018) ‘Primal-Dual Proximal Algorithms for Structured Convex Optimization: A Unifying Framework’, Lecture notes in mathematics, pp. 97–120. doi:10.1007/978-3-319-97478-1_5.

IEEE

P. Latafat and P. Patrinos, “Primal-Dual Proximal Algorithms for Structured Convex Optimization: A Unifying Framework,” Lecture notes in mathematics, pp. 97–120, 2018, doi: 10.1007/978-3-319-97478-1_5.

BibTeX

@incollection{latafat2018primal,
  title     = {{Primal-Dual Proximal Algorithms for Structured Convex Optimization: A Unifying Framework}},
  author    = {Latafat, Puya and Patrinos, Panagiotis},
  booktitle = {Lecture notes in mathematics},
  publisher = {Springer Nature},
  year      = {2018},
  pages     = {97--120},
  doi       = {10.1007/978-3-319-97478-1_5},
  url       = {https://doi.org/10.1007/978-3-319-97478-1_5}
}

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

Citations by year

YearCitationsShare of the best year
201922
202122
202244
202311
202422

Its field-weighted citation impact is 3.08: it has been cited 3.08 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

  • structured convex optimization
  • nonsmooth optimization
  • linear convergence

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?

Latafat, P., & Patrinos, P. (2018). Primal-Dual Proximal Algorithms for Structured Convex Optimization: A Unifying Framework. Lecture notes in mathematics, 97–120. https://doi.org/10.1007/978-3-319-97478-1_5

How many times has this paper been cited?

11 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?

Yes. It is open access: read the free full text at Lirias.

Who wrote this paper?

Puya Latafat, Panagiotis Patrinos.

What is the DOI of this paper?

10.1007/978-3-319-97478-1_5. The permanent link is https://doi.org/10.1007/978-3-319-97478-1_5.

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.