Gradient Methods

Zdeněk Dostál ()
Additional contact information
Zdeněk Dostál: VŠB - Technical University Ostrava

Chapter 3 in Optimal Quadratic Programming and QCQP Algorithms with Applications, 2025, pp 85-98 from Springer

Abstract: Abstract We review the basic algorithms using the gradient direction for unconstrained QP problems, discuss their convergence in Euclidean and energy norm, and examine the effect of the steplength on their performance. We pay special attention to the possibility of enhancing the information from the previous step via the steplength (the Barizilai–Borwein method) or momentum (Polyak’s heavy ball method).

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_3

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

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

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