MPGP and PBBF for Separable QCQP

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

Chapter Chapter 11 in Optimal Quadratic Programming and QCQP Algorithms with Applications, 2025, pp 249-269 from Springer

Abstract: Abstract We describe the MPGP (modified proportioning with gradient projection) algorithm for solving quadratic programming problems with separable constraints. The algorithm combines the conjugate gradient steps to minimize the cost function in the face with gradient projection steps to change the face. The decision on which step to use depends on violating the KKT conditions. The MPGP algorithm enjoys the R-linear rate of convergence of both the cost function and norm of projected gradient. We also present an alternative PBBF algorithm using projected Barzilai–Borwein steps with fallback. The performance of the algorithms, including scalability, is illustrated by solving a contact problem with anisotropic Coulomb friction.

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_11

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

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

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