Journal article · 2024 · Open access

Primal Subgradient Methods with Predefined Step Sizes

Yurii E. Nesterov

Journal of Optimization Theory and Applications, 203(3), 2083–2115 · Published 31 May 2024 · DOI 10.1007/s10957-024-02456-9

Read the free full textCite this paper

In brief

“Primal Subgradient Methods with Predefined Step Sizes” is a 2024 journal article by Yurii E. Nesterov, published in Journal of Optimization Theory and Applications. OpenAlex counts 3 citations as of 16 November 2026. It is open access under a CC BY licence: the full text is free to read at Journal of Optimization Theory and Applications.

Citations
3
Most cited in
2026 (2)
Field-weighted impact
0.78
References
7
Authors
1

Abstract

In this paper, we suggest a new framework for analyzing primal subgradient methods for nonsmooth convex optimization problems. We show that the classical step-size rules, based on normalization of subgradient, or on knowledge of the optimal value of the objective function, need corrections when they are applied to optimization problems with constraints. Their proper modifications allow a significant acceleration of these schemes when the objective function has favorable properties (smoothness, strong convexity). We show how the new methods can be used for solving optimization problems with functional constraints with a possibility to approximate the optimal Lagrange multipliers. One of our primal-dual methods works also for unbounded feasible set.

Cite this paper

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

APA 7

Nesterov, Y. E. (2024). Primal Subgradient Methods with Predefined Step Sizes. Journal of Optimization Theory and Applications, 203(3), 2083–2115. https://doi.org/10.1007/s10957-024-02456-9

MLA 9

Nesterov, Yurii E. “Primal Subgradient Methods with Predefined Step Sizes.” Journal of Optimization Theory and Applications, vol. 203, no. 3, 2024, pp. 2083–2115. https://doi.org/10.1007/s10957-024-02456-9.

Chicago

Nesterov, Yurii E. 2024. “Primal Subgradient Methods with Predefined Step Sizes.” Journal of Optimization Theory and Applications 203 (3): 2083–2115. https://doi.org/10.1007/s10957-024-02456-9.

Harvard

Nesterov, Y. E. (2024) ‘Primal Subgradient Methods with Predefined Step Sizes’, Journal of Optimization Theory and Applications, 203(3), pp. 2083–2115. doi:10.1007/s10957-024-02456-9.

IEEE

Y. E. Nesterov, “Primal Subgradient Methods with Predefined Step Sizes,” Journal of Optimization Theory and Applications, vol. 203, no. 3, pp. 2083–2115, 2024, doi: 10.1007/s10957-024-02456-9.

BibTeX

@article{nesterov2024primal,
  title     = {{Primal Subgradient Methods with Predefined Step Sizes}},
  author    = {Nesterov, Yurii E.},
  journal   = {Journal of Optimization Theory and Applications},
  year      = {2024},
  volume    = {203},
  number    = {3},
  pages     = {2083--2115},
  doi       = {10.1007/s10957-024-02456-9},
  url       = {https://doi.org/10.1007/s10957-024-02456-9}
}

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

Topic and keywords

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

  • nonsmooth convex optimization
  • constrained optimization
  • strong convexity
  • functional constraints
  • Lagrange multipliers
  • primal-dual algorithm

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?

Nesterov, Y. E. (2024). Primal Subgradient Methods with Predefined Step Sizes. Journal of Optimization Theory and Applications, 203(3), 2083–2115. https://doi.org/10.1007/s10957-024-02456-9

How many times has this paper been cited?

3 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 Journal of Optimization Theory and Applications.

Who wrote this paper?

Yurii E. Nesterov.

What is the DOI of this paper?

10.1007/s10957-024-02456-9. The permanent link is https://doi.org/10.1007/s10957-024-02456-9.

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.