Globalizing Stabilized Sequential Quadratic Programming Method by Smooth Primal-Dual Exact Penalty Function

A. F. Izmailov (), M. V. Solodov () and E. I. Uskov ()
Additional contact information
A. F. Izmailov: Lomonosov Moscow State University (MSU)
M. V. Solodov: Instituto de Matemática Pura e Aplicada (IMPA)
E. I. Uskov: Tambov State University

Journal of Optimization Theory and Applications, 2016, vol. 169, issue 1, No 8, 148-178

Abstract: Abstract An iteration of the stabilized sequential quadratic programming method consists in solving a certain quadratic program in the primal-dual space, regularized in the dual variables. The advantage with respect to the classical sequential quadratic programming is that no constraint qualifications are required for fast local convergence (i.e., the problem can be degenerate). In particular, for equality-constrained problems, the superlinear rate of convergence is guaranteed under the only assumption that the primal-dual starting point is close enough to a stationary point and a noncritical Lagrange multiplier (the latter being weaker than the second-order sufficient optimality condition). However, unlike for the usual sequential quadratic programming method, designing natural globally convergent algorithms based on the stabilized version proved quite a challenge and, currently, there are very few proposals in this direction. For equality-constrained problems, we suggest to use for the task linesearch for the smooth two-parameter exact penalty function, which is the sum of the Lagrangian with squared penalizations of the violation of the constraints and of the violation of the Lagrangian stationarity with respect to primal variables. Reasonable global convergence properties are established. Moreover, we show that the globalized algorithm preserves the superlinear rate of the stabilized sequential quadratic programming method under the weak conditions mentioned above. We also present some numerical experiments on a set of degenerate test problems.

Keywords: Stabilized sequential quadratic programming; Superlinear convergence; Global convergence; Exact penalty function; Second-order sufficiency; Noncritical Lagrange multiplier; 65K05; 65K15; 90C30 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-016-0889-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:joptap:v:169:y:2016:i:1:d:10.1007_s10957-016-0889-y

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-016-0889-y

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().