Conjugate Gradients as Iterative Method

Zdeněk Dostál ()
Additional contact information
Zdeněk Dostál: VŠB - Technical University Ostrava, National Super computer Center and Department of Applied Mathematics

Chapter 8 in Optimal Quadratic Programming and QCQP Algorithms with Case Studies, 2025, pp 161-188 from Springer

Abstract: Abstract Using the Chebyshev polynomials, we first give the bounds on the conjugate gradient iterates’ error in bounds on the spectrum of the SPD Hessian of the cost function. Then, we present two methods of improving the rate of convergence of conjugate gradients, in particular, preconditioning using specific information about the problem and preconditioning by the conjugate projector. The latter method does not transform variables so that it can be applied to problems with separable constraints. Finally, we present the algorithm cgSLS for solving the least square problems with symmetric positive semidefinite Hessian. We validate the theory by numerical experiments.

Date: 2025
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-031-95167-1_8

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

DOI: 10.1007/978-3-031-95167-1_8

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 ().