Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Mathematics of Operations Research Year : 2016

Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs

Abstract

In view of solving nonsmooth and nonconvex problems involving complex constraints (like standard NLP problems), we study general maximization-minimization procedures produced by families of strongly convex sub-problems. Using techniques from semi-algebraic geometry and variational analysis -in particular Lojasiewicz inequality- we establish the convergence of sequences generated by this type of schemes to critical points. The broad applicability of this process is illustrated in the context of NLP. In that case critical points coincide with KKT points. When the data are semi-algebraic or real analytic our method applies (for instance) to the study of various SQP methods: the moving balls method, Sl1QP, ESQP. Under standard qualification conditions, this provides -to the best of our knowledge- the first general convergence results for general nonlinear programming problems. We emphasize the fact that, unlike most works on this subject, no second-order assumption and/or convexity assumptions whatsoever are made. Rate of convergence are shown to be of the same form as those commonly encountered with first order methods.
Fichier principal
Vignette du fichier
SQP.pdf (410.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01069737 , version 1 (29-09-2014)

Identifiers

Cite

Jérôme Bolte, Edouard Pauwels. Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs. Mathematics of Operations Research, 2016, 41 (2), ⟨10.1287/moor.2015.0735⟩. ⟨hal-01069737⟩
286 View
377 Download

Altmetric

Share

Gmail Facebook X LinkedIn More