Book chapter · 2022

Steepest Descent Methods

Neculai Andrei

Springer optimization and its applications, 81–107 · Published 18 October 2022 · DOI 10.1007/978-3-031-08720-2_3

View at the publisherCite this paper

In brief

“Steepest Descent Methods” is a 2022 book chapter by Neculai Andrei, published in Springer optimization and its applications. OpenAlex counts 7 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
7
Most cited in
2025 (3)
Field-weighted impact
7.77
References
11
Authors
1

Cite this paper

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

APA 7

Andrei, N. (2022). Steepest Descent Methods. Springer optimization and its applications, 81–107. https://doi.org/10.1007/978-3-031-08720-2_3

MLA 9

Andrei, Neculai. “Steepest Descent Methods.” Springer optimization and its applications, 2022, pp. 81–107. https://doi.org/10.1007/978-3-031-08720-2_3.

Chicago

Andrei, Neculai. 2022. “Steepest Descent Methods.” Springer optimization and its applications: 81–107. https://doi.org/10.1007/978-3-031-08720-2_3.

Harvard

Andrei, N. (2022) ‘Steepest Descent Methods’, Springer optimization and its applications, pp. 81–107. doi:10.1007/978-3-031-08720-2_3.

IEEE

N. Andrei, “Steepest Descent Methods,” Springer optimization and its applications, pp. 81–107, 2022, doi: 10.1007/978-3-031-08720-2_3.

BibTeX

@incollection{andrei2022steepest,
  title     = {{Steepest Descent Methods}},
  author    = {Andrei, Neculai},
  booktitle = {Springer optimization and its applications},
  publisher = {Springer International Publishing},
  year      = {2022},
  pages     = {81--107},
  doi       = {10.1007/978-3-031-08720-2_3},
  url       = {https://doi.org/10.1007/978-3-031-08720-2_3}
}

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

Citations by year

YearCitationsShare of the best year
202422
202533
202611

Its field-weighted citation impact is 7.77: it has been cited 7.77 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 › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research

  • steepest descent method
  • gradient-based optimization
  • unconstrained optimization
  • descent search direction
  • line search
  • step size selection
  • Cauchy method
  • multivariate optimization

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Andrei, N. (2022). Steepest Descent Methods. Springer optimization and its applications, 81–107. https://doi.org/10.1007/978-3-031-08720-2_3

How many times has this paper been cited?

7 times, according to OpenAlex on 19 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?

Neculai Andrei.

What is the DOI of this paper?

10.1007/978-3-031-08720-2_3, permanently at https://doi.org/10.1007/978-3-031-08720-2_3. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.