Journal article · 2020 · Open access

Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization

Maxim Viktorovich Balashov, Boris T. Polyak, Тремба Андрей Александрович

Numerical Functional Analysis and Optimization, 41(7), 822–849 · Published 7 January 2020 · DOI 10.1080/01630563.2019.1704780

Free PDFView at the publisherCite this paper

In brief

“Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization” is a 2020 journal article by Maxim Viktorovich Balashov and 2 co-authors, published in Numerical Functional Analysis and Optimization. OpenAlex counts 45 citations as of 16 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
45
Most cited in
2020 (10)
Field-weighted impact
5.57
References
35
Authors
3

Abstract

Minimization of a smooth function on a sphere or, more generally, on a smooth manifold, is the simplest non-convex optimization problem. It has a lot of applications. Our goal is to propose a version of the gradient projection algorithm for its solution and to obtain results that guarantee convergence of the algorithm under some minimal natural assumptions. We use the Ležanski-Polyak-Lojasiewicz condition on a manifold to prove the global linear convergence of the algorithm. Another method well fitted for the problem is the conditional gradient (Frank-Wolfe) algorithm. We examine some conditions which guarantee global convergence of full-step version of the method with linear rate.

Cite this paper

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

APA 7

Balashov, M. V., Polyak, B. T., & Александрович, Т. А. (2020). Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization. Numerical Functional Analysis and Optimization, 41(7), 822–849. https://doi.org/10.1080/01630563.2019.1704780

MLA 9

Balashov, Maxim Viktorovich, et al. “Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization.” Numerical Functional Analysis and Optimization, vol. 41, no. 7, 2020, pp. 822–849. https://doi.org/10.1080/01630563.2019.1704780.

Chicago

Balashov, Maxim Viktorovich, Boris T. Polyak, and Тремба Андрей Александрович. 2020. “Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization.” Numerical Functional Analysis and Optimization 41 (7): 822–849. https://doi.org/10.1080/01630563.2019.1704780.

Harvard

Balashov, M. V., Polyak, B. T. and Александрович, Т. А. (2020) ‘Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization’, Numerical Functional Analysis and Optimization, 41(7), pp. 822–849. doi:10.1080/01630563.2019.1704780.

IEEE

M. V. Balashov, B. T. Polyak, and Т. А. Александрович, “Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization,” Numerical Functional Analysis and Optimization, vol. 41, no. 7, pp. 822–849, 2020, doi: 10.1080/01630563.2019.1704780.

BibTeX

@article{balashov2020gradient,
  title     = {{Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization}},
  author    = {Balashov, Maxim Viktorovich and Polyak, Boris T. and Александрович, Тремба Андрей},
  journal   = {Numerical Functional Analysis and Optimization},
  year      = {2020},
  volume    = {41},
  number    = {7},
  pages     = {822--849},
  doi       = {10.1080/01630563.2019.1704780},
  url       = {https://doi.org/10.1080/01630563.2019.1704780}
}

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

Citations by year

YearCitationsShare of the best year
201911
20201010
202188
202244
202366
202488
202555
202633

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

  • gradient projection
  • Frank-Wolfe algorithm
  • non-convex optimization
  • constrained minimization
  • smooth manifolds
  • sphere
  • global 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?

Balashov, M. V., Polyak, B. T., & Александрович, Т. А. (2020). Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization. Numerical Functional Analysis and Optimization, 41(7), 822–849. https://doi.org/10.1080/01630563.2019.1704780

How many times has this paper been cited?

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

Maxim Viktorovich Balashov, Boris T. Polyak, Тремба Андрей Александрович.

What is the DOI of this paper?

10.1080/01630563.2019.1704780. The permanent link is https://doi.org/10.1080/01630563.2019.1704780.

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.