Journal article · 2021 · Open access

Primal-dual subgradient method for constrained convex optimization problems

Michael R. Metel, Akiko Takeda

Optimization Letters, 15(4), 1491–1504 · Published 5 April 2021 · DOI 10.1007/s11590-021-01728-x

Free PDFView at the publisherCite this paper

In brief

“Primal-dual subgradient method for constrained convex optimization problems” is a 2021 journal article by Michael R. Metel and Akiko Takeda, published in Optimization Letters. OpenAlex counts 4 citations as of 16 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
4
Most cited in
2023 (2)
Field-weighted impact
0.56
References
9
Authors
2

Cite this paper

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

APA 7

Metel, M. R., & Takeda, A. (2021). Primal-dual subgradient method for constrained convex optimization problems. Optimization Letters, 15(4), 1491–1504. https://doi.org/10.1007/s11590-021-01728-x

MLA 9

Metel, Michael R., and Akiko Takeda. “Primal-dual subgradient method for constrained convex optimization problems.” Optimization Letters, vol. 15, no. 4, 2021, pp. 1491–1504. https://doi.org/10.1007/s11590-021-01728-x.

Chicago

Metel, Michael R. and Akiko Takeda. 2021. “Primal-dual subgradient method for constrained convex optimization problems.” Optimization Letters 15 (4): 1491–1504. https://doi.org/10.1007/s11590-021-01728-x.

Harvard

Metel, M. R. and Takeda, A. (2021) ‘Primal-dual subgradient method for constrained convex optimization problems’, Optimization Letters, 15(4), pp. 1491–1504. doi:10.1007/s11590-021-01728-x.

IEEE

M. R. Metel and A. Takeda, “Primal-dual subgradient method for constrained convex optimization problems,” Optimization Letters, vol. 15, no. 4, pp. 1491–1504, 2021, doi: 10.1007/s11590-021-01728-x.

BibTeX

@article{metel2021primal,
  title     = {{Primal-dual subgradient method for constrained convex optimization problems}},
  author    = {Metel, Michael R. and Takeda, Akiko},
  journal   = {Optimization Letters},
  year      = {2021},
  volume    = {15},
  number    = {4},
  pages     = {1491--1504},
  doi       = {10.1007/s11590-021-01728-x},
  url       = {https://doi.org/10.1007/s11590-021-01728-x}
}

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

Citations by year

YearCitationsShare of the best year
202111
202322
202511

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

  • constrained convex optimization
  • non-differentiable functions
  • non-Lipschitz functions
  • first-order methods
  • optimal convergence rates
  • subgradient method

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?

Metel, M. R., & Takeda, A. (2021). Primal-dual subgradient method for constrained convex optimization problems. Optimization Letters, 15(4), 1491–1504. https://doi.org/10.1007/s11590-021-01728-x

How many times has this paper been cited?

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

Michael R. Metel, Akiko Takeda.

What is the DOI of this paper?

10.1007/s11590-021-01728-x. The permanent link is https://doi.org/10.1007/s11590-021-01728-x.

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.