Journal article · 2019

Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimization

Davood Hajinezhad, Mingyi Hong

Mathematical Programming, 176(1-2), 207–245 · Published 20 February 2019 · DOI 10.1007/s10107-019-01365-4

View at the publisherCite this paper

In brief

“Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimization” is a 2019 journal article by Davood Hajinezhad and Mingyi Hong, published in Mathematical Programming. OpenAlex counts 62 citations as of 16 November 2026, which puts it in the top 5% of works published in 2019 by citations. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
62
Most cited in
2022 (14)
Field-weighted impact
6.83
References
87
Authors
2

Cite this paper

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

APA 7

Hajinezhad, D., & Hong, M. (2019). Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimization. Mathematical Programming, 176(1-2), 207–245. https://doi.org/10.1007/s10107-019-01365-4

MLA 9

Hajinezhad, Davood, and Mingyi Hong. “Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimization.” Mathematical Programming, vol. 176, no. 1-2, 2019, pp. 207–245. https://doi.org/10.1007/s10107-019-01365-4.

Chicago

Hajinezhad, Davood and Mingyi Hong. 2019. “Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimization.” Mathematical Programming 176 (1-2): 207–245. https://doi.org/10.1007/s10107-019-01365-4.

Harvard

Hajinezhad, D. and Hong, M. (2019) ‘Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimization’, Mathematical Programming, 176(1-2), pp. 207–245. doi:10.1007/s10107-019-01365-4.

IEEE

D. Hajinezhad and M. Hong, “Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimization,” Mathematical Programming, vol. 176, no. 1-2, pp. 207–245, 2019, doi: 10.1007/s10107-019-01365-4.

BibTeX

@article{hajinezhad2019perturbed,
  title     = {{Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimization}},
  author    = {Hajinezhad, Davood and Hong, Mingyi},
  journal   = {Mathematical Programming},
  year      = {2019},
  volume    = {176},
  number    = {1-2},
  pages     = {207--245},
  doi       = {10.1007/s10107-019-01365-4},
  url       = {https://doi.org/10.1007/s10107-019-01365-4}
}

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

Citations by year

YearCitationsShare of the best year
201833
201933
202088
202177
20221414
20231010
202444
202544
202699

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

  • nonsmooth nonconvex optimization
  • linearly constrained optimization
  • Uzawa algorithm
  • dual ascent
  • asymptotic convergence
  • convergence rate
  • distributed learning

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?

Hajinezhad, D., & Hong, M. (2019). Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimization. Mathematical Programming, 176(1-2), 207–245. https://doi.org/10.1007/s10107-019-01365-4

How many times has this paper been cited?

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

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?

Davood Hajinezhad, Mingyi Hong.

What is the DOI of this paper?

10.1007/s10107-019-01365-4. The permanent link is https://doi.org/10.1007/s10107-019-01365-4.

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.