Solvers for Separable and Equality QP/QCQP Problems

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

Chapter Chapter 12 in Optimal Quadratic Programming and QCQP Algorithms with Applications, 2025, pp 271-304 from Springer

Abstract: Abstract The chapter describes the algorithm SMALSE (semi-monotonic augmented Lagrangians for separable and equality constraints) and its variant SMALBE for bound and equality constraints. The main idea of the algorithms is to treat both sets of constraints separately. This approach enables us to use the ingredients of the algorithms of the previous chapters. We also consider the algorithm SMALSE-Mw for separable and equality constraints with a strong curvature of the feasible set boundary. We prove the convergence results that support the solving of large problems. We introduce the adaptive preconditioning for improving the convergence rate. Numerical experiments illustrate optimality and the effect of adaptive reorthogonalization.

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_12

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

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

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