Optimization Online


A second-order sequential optimality condition associated to the convergence of optimization algorithms

Roberto Andreani (andreani***at***ime.unicamp.br)
Gabriel Haeser (ghaeser***at***ime.usp.br)
Alberto Ramos (aramos27***at***gmail.com)
Paulo J.S. Silva (pjssilva***at***ime.unicamp.br)

Abstract: Sequential optimality conditions have recently played an important role on the analysis of the global convergence of optimization algorithms towards first-order stationary points and justifying their stopping criteria. In this paper we introduce the first sequential optimality condition that takes into account second-order information. We also present a companion constraint qualification that is less stringent than previous ones associated to the convergence of second-order algorithms, like the joint condition Mangasarian-Fromovitz and Weak Constant Rank. Our condition is also weaker than the classical Constant Rank Constraint Qualification, which associates this condition to the convergence of second-order algorithms. This means that we can prove second-order global convergence of well stablished algorithms even when the set of Lagrange multipliers is unbounded, which overcomes a limitation of previous results based on MFCQ. We prove global convergence of well known variations of the augmented Lagrangian and Regularized SQP methods to second-order stationary points under this new weak constraint qualification.

Keywords: Nonlinear Programming, Constraint Qualifications, Algorithmic Convergence

Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization )


Download: [PDF]

Entry Submitted: 04/29/2015
Entry Accepted: 04/29/2015
Entry Last Modified: 10/08/2015

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society