Linear Conjugate Gradient Algorithm

Neculai Andrei ()
Additional contact information
Neculai Andrei: Academy of Romanian Scientists

Chapter Chapter 2 in Nonlinear Conjugate Gradient Methods for Unconstrained Optimization, 2020, pp 67-87 from Springer

Abstract: Abstract The linear conjugate gradient algorithm is dedicated to minimizing convex quadratic functions (or solving linear algebraic systems of equations with positive definite matrices). This algorithm was introduced by Hestenes and Stiefel (1952).

Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-42950-8_2

Ordering information: This item can be ordered from
http://www.springer.com/9783030429508

DOI: 10.1007/978-3-030-42950-8_2

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().