Constraint identification and algorithm stabilization for degenerate nonlinear programs

From MaRDI portal
Publication:1411635

DOI10.1007/s10107-002-0344-8zbMath1030.90126arXivmath/0012209OpenAlexW2593671840MaRDI QIDQ1411635

Stephen J. Wright

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




Related Items

On the componentwise boundedness away from zero of iterates generated by stabilized interior point methodsExamples of dual behaviour of Newton-type methods on optimization problems with degenerate constraintsAn inexact restoration strategy for the globalization of the sSQP methodAn LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutionsNewton-type methods for constrained optimization with nonregular constraintsA quasi-Newton strategy for the SSQP method for variational inequality and optimization problemsStabilized SQP revisitedStabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problemsGlobal and local convergence of a nonmonotone SQP method for constrained nonlinear optimizationOn attraction of Newton-type iterates to multipliers violating second-order sufficiency conditionsA stabilized SQP method: superlinear convergenceNewton-type methods: a broader viewSubspace-stabilized sequential quadratic programmingInexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimizationSolution sensitivity for Karush–Kuhn–Tucker systems with non-unique Lagrange multipliersThep-Factor-Lagrange Methods for Degenerate Nonlinear ProgrammingMajorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame ProgramsComments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about itComments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about itA superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints