On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers
From MaRDI portal
Publication:623363
DOI10.1007/s10107-009-0279-4zbMath1218.90184OpenAlexW2045664455MaRDI QIDQ623363
Mikhail V. Solodov, Alexey F. Izmailov
Publication date: 14 February 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0279-4
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items (17)
Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function ⋮ A globally convergent regularized interior point method for constrained optimization ⋮ A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm ⋮ Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework ⋮ Critical solutions of nonlinear equations: stability issues ⋮ 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 ⋮ Local attractors of Newton-type methods for constrained equations and complementarity problems with nonisolated solutions ⋮ Primal-dual active-set methods for large-scale optimization ⋮ Attraction of Newton method to critical Lagrange multipliers: fully quadratic case ⋮ An adaptive augmented Lagrangian method for large-scale constrained optimization ⋮ On the attraction of Newton’s method to critical lagrange multipliers ⋮ A stabilized SQP method: superlinear convergence ⋮ Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption ⋮ Adaptive augmented Lagrangian methods: algorithms and practical numerical experience ⋮ Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it
Uses Software
Cites Work
- 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
- Singularities and groups in bifurcation theory. Volume I
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- Stabilized sequential quadratic 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
- Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
- A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
- Numerical Optimization
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Modifying SQP for Degenerate Problems
- Modified Wilson's Method for Nonlinear Programs with Nonunique Multipliers
- A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization
- A quadratically-convergent algorithm for general nonlinear programming problems
This page was built for publication: On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers
