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.90184MaRDI QIDQ623363
Alexey F. Izmailov, Mikhail V. Solodov
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
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
90C55: Methods of successive quadratic programming type
Related Items
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
