Constraint identification and algorithm stabilization for degenerate nonlinear programs
From MaRDI portal
Publication:1411635
DOI10.1007/S10107-002-0344-8zbMath1030.90126arXivmath/0012209OpenAlexW2593671840MaRDI QIDQ1411635
Publication date: 29 October 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0012209
Sensitivity, stability, parametric optimization (90C31) Methods of successive quadratic programming type (90C55)
Related Items (20)
On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods ⋮ Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints ⋮ An inexact restoration strategy for the globalization of the sSQP method ⋮ An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions ⋮ Newton-type methods for constrained optimization with nonregular constraints ⋮ A quasi-Newton strategy for the SSQP method for variational inequality and optimization problems ⋮ Stabilized SQP revisited ⋮ Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems ⋮ Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization ⋮ On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions ⋮ A stabilized SQP method: superlinear convergence ⋮ 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 ⋮ Solution sensitivity for Karush–Kuhn–Tucker systems with non-unique Lagrange multipliers ⋮ Thep-Factor-Lagrange Methods for Degenerate Nonlinear Programming ⋮ Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs ⋮ Comments on: 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 ⋮ A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
This page was built for publication: Constraint identification and algorithm stabilization for degenerate nonlinear programs
