Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems

DOI10.1007/s10107-008-0255-4zbMath1203.90144OpenAlexW1983585148MaRDI QIDQ1960188

Damián Fernández, Mikhail V. Solodov

Publication date: 13 October 2010

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

Full work available at URL: https://doi.org/10.1007/s10107-008-0255-4

zbMATH Keywords

superlinear convergenceSOCMFCQconstraint degeneracynon-unique Lagrange multipliers

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items (36)

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 ⋮ An inexact restoration strategy for the globalization of the sSQP method ⋮ A stabilized filter SQP algorithm for nonlinear programming ⋮ A globally convergent regularized interior point method for constrained optimization ⋮ Convergence analysis of a regularized interior point algorithm for the barrier problems with singular solutions ⋮ Convergence of a stabilized SQP method for equality constrained optimization ⋮ An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions ⋮ On the cost of solving augmented Lagrangian subproblems ⋮ On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers ⋮ A quasi-Newton strategy for the SSQP method for variational inequality and optimization problems ⋮ Stabilized SQP revisited ⋮ 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 ⋮ A special complementarity function revisited ⋮ Strong calmness of perturbed KKT system for a class of conic programming with degenerate solutions ⋮ 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 ⋮ Primal-dual active-set methods for large-scale optimization ⋮ An adaptive augmented Lagrangian method for large-scale constrained optimization ⋮ A Regularized Factorization-Free Method for Equality-Constrained Optimization ⋮ A stabilized SQP method: superlinear convergence ⋮ A Predictor-Corrector Path-Following Algorithm for Dual-Degenerate Parametric Optimization Problems ⋮ Newton-type methods: a broader view ⋮ Subspace-stabilized sequential quadratic programming ⋮ Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization ⋮ 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 ⋮ A Globally Convergent LP-Newton Method ⋮ Local and Global Analysis of Multiplier Methods for Constrained Optimization in Banach Spaces ⋮ 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

Cites Work

• Unnamed Item
• 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
• Error bounds in mathematical programming
• Local behavior of an iterative framework for generalized equations with nonisolated solutions
• Karush-Kuhn-Tucker systems: regularity conditions, error bounds and a class of Newton-type methods
• Constraint identification and algorithm stabilization for degenerate nonlinear programs
• Some continuity properties of polyhedral multifunctions
• 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
• An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space

This page was built for publication: Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems