Book chapter · 2022

Fundamentals on Unconstrained Optimization. Stepsize Computation

Neculai Andrei

Springer optimization and its applications, 21–80 · Published 18 October 2022 · DOI 10.1007/978-3-031-08720-2_2

View at the publisherCite this paper

In brief

“Fundamentals on Unconstrained Optimization. Stepsize Computation” is a 2022 book chapter by Neculai Andrei, published in Springer optimization and its applications. OpenAlex counts 0 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
0
References
51
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). Fundamentals on Unconstrained Optimization. Stepsize Computation. Springer optimization and its applications, 21–80. https://doi.org/10.1007/978-3-031-08720-2_2

MLA 9

Andrei, Neculai. “Fundamentals on Unconstrained Optimization. Stepsize Computation.” Springer optimization and its applications, 2022, pp. 21–80. https://doi.org/10.1007/978-3-031-08720-2_2.

Chicago

Andrei, Neculai. 2022. “Fundamentals on Unconstrained Optimization. Stepsize Computation.” Springer optimization and its applications: 21–80. https://doi.org/10.1007/978-3-031-08720-2_2.

Harvard

Andrei, N. (2022) ‘Fundamentals on Unconstrained Optimization. Stepsize Computation’, Springer optimization and its applications, pp. 21–80. doi:10.1007/978-3-031-08720-2_2.

IEEE

N. Andrei, “Fundamentals on Unconstrained Optimization. Stepsize Computation,” Springer optimization and its applications, pp. 21–80, 2022, doi: 10.1007/978-3-031-08720-2_2.

BibTeX

@incollection{andrei2022fundamentals,
  title     = {{Fundamentals on Unconstrained Optimization. Stepsize Computation}},
  author    = {Andrei, Neculai},
  booktitle = {Springer optimization and its applications},
  publisher = {Springer International Publishing},
  year      = {2022},
  pages     = {21--80},
  doi       = {10.1007/978-3-031-08720-2_2},
  url       = {https://doi.org/10.1007/978-3-031-08720-2_2}
}

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

Topic and keywords

Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research

  • unconstrained optimization
  • descent search direction
  • iterative optimization algorithm
  • convergence properties
  • optimality conditions
  • first-order methods
  • second-order methods
  • large-scale 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). Fundamentals on Unconstrained Optimization. Stepsize Computation. Springer optimization and its applications, 21–80. https://doi.org/10.1007/978-3-031-08720-2_2

How many times has this paper been cited?

0 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_2, permanently at https://doi.org/10.1007/978-3-031-08720-2_2. 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.