Stabilized SQP revisited

DOI10.1007/s10107-010-0413-3zbMath1245.90145OpenAlexW2079693963MaRDI QIDQ431014

Alexey F. Izmailov, Mikhail V. Solodov

Publication date: 26 June 2012

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-010-0413-3

zbMATH Keywords

constrained optimizationerror boundsuperlinear convergencesecond-order sufficiencystabilized SQPcritical multipliersdegenerate constraintslocal regularization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of successive quadratic programming type (90C55)

Related Items (44)

On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods ⋮ Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function ⋮ Safeguarded Augmented Lagrangian Methods in Banach Spaces ⋮ An inexact restoration strategy for the globalization of the sSQP method ⋮ A globally convergent regularized interior point method for constrained optimization ⋮ A new trust region–sequential quadratic programming approach for nonlinear systems based on nonlinear model predictive control ⋮ Critical multipliers in variational systems via second-order generalized differentiation ⋮ A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm ⋮ Newton's method may fail to recognize proximity to optimal points in constrained optimization ⋮ Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework ⋮ Combining stabilized SQP with the augmented Lagrangian algorithm ⋮ Convergence of a stabilized SQP method for equality constrained optimization ⋮ An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions ⋮ Adjusting Dual Iterates in the Presence of Critical Lagrange Multipliers ⋮ The Dines theorem and some other properties of quadratic mappings ⋮ Critical solutions of nonlinear equations: local attraction for Newton-type methods ⋮ A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems ⋮ Strong calmness of perturbed KKT system for a class of conic programming with degenerate solutions ⋮ A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application ⋮ Sequential quadratic programming methods for parametric nonlinear optimization ⋮ A globally convergent Levenberg-Marquardt method for equality-constrained optimization ⋮ Newton-type methods near critical solutions of piecewise smooth nonlinear equations ⋮ Attraction of Newton method to critical Lagrange multipliers: fully quadratic case ⋮ An adaptive augmented Lagrangian method for large-scale constrained optimization ⋮ A Regularized Factorization-Free Method for Equality-Constrained Optimization ⋮ On Error Bounds and Multiplier Methods for Variational Problems in Banach Spaces ⋮ An adaptively regularized sequential quadratic programming method for equality constrained optimization ⋮ A stabilized SQP method: superlinear convergence ⋮ A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences ⋮ Newton-type methods: a broader view ⋮ Subspace-stabilized sequential quadratic programming ⋮ On the behaviour of constrained optimization methods when Lagrange multipliers do not exist ⋮ Unit stepsize for the Newton method close to critical solutions ⋮ Accelerating convergence of the globalized Newton method to critical solutions of nonlinear equations ⋮ Convergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutions ⋮ Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption ⋮ Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers ⋮ Criticality of Lagrange Multipliers in Variational Systems ⋮ A superlinear convergence feasible sequential quadratic programming algorithm for bipedal dynamic walking robot via discrete mechanics and optimal control ⋮ Directional Quasi-/Pseudo-Normality as Sufficient Conditions for Metric Subregularity ⋮ Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications ⋮ Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it ⋮ Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it ⋮ Primal superlinear convergence of SQP methods in piecewise linear-quadratic composite optimization

Cites Work

• Unnamed Item
• Unnamed Item
• On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers
• Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints
• On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions
• Superlinear convergence of a stabilized SQP method to a degenerate solution
• Stabilized sequential quadratic programming
• Stability in the presence of degeneracy and error estimation
• Local analysis of Newton-type methods for variational inequalities and nonlinear programming
• Local behavior of an iterative framework for generalized equations with nonisolated solutions
• Constraint identification and algorithm stabilization for degenerate nonlinear programs
• Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• On uniqueness of Kuhn-Tucker multipliers in nonlinear programming
• On the Accurate Identification of Active Constraints
• Newton-Type Methods for Optimization Problems without Constraint Qualifications
• Modifying SQP for Degenerate Problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• A Class of Active-Set Newton Methods for Mixed ComplementarityProblems
• An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence
• Definite and Semidefinite Quadratic Forms
• Global Optimization and Constraint Satisfaction

This page was built for publication: Stabilized SQP revisited