SMALE for Equality Constraints

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

Chapter 9 in Optimal Quadratic Programming and QCQP Algorithms with Applications, 2025, pp 189-214 from Springer

Abstract: Abstract Here, we present two variants of the augmented Lagrangian method that use the conjugate gradient method in the inner loop. We start with the asymptotically exact augmented Lagrangian method, controlling the precision of the auxiliary problem’s solutions by a user-defined forcing sequence. The regularization parameter controls the convergence rate of the outer loop. The second method is SMALE (semi-monotonic augmented Lagrangian for equality constraints). The inner loop precision is regulated by the increase of the Lagrangian. The unique theoretical results concerning SMALE include a bound on the number of iterations necessary to find an approximate solution with prescribed error and independent of the conditioning of constraints. The performance of SMALE can be improved by preconditioning that preserves the gap in the spectrum. The algorithms accept dependent equality constraints.

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_9

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

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

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