Karush-Kuhn-Tucker systems: regularity conditions, error bounds and a class of Newton-type methods

DOI10.1007/s10107-002-0346-6zbMath1023.90063OpenAlexW2138319970MaRDI QIDQ1396838

Alexey F. Izmailov, Mikhail V. Solodov

Publication date: 13 July 2003

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

Full work available at URL: https://doi.org/10.1007/s10107-002-0346-6

zbMATH Keywords

regularityerror boundactive constraintsNewton methodKKT system

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items (12)

Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints ⋮ Primal-dual active-set algorithm for chemical equilibrium problems related to the modeling of atmospheric inorganic aerosols ⋮ On regularity conditions for complementarity problems ⋮ On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers ⋮ The effect of calmness on the solution set of systems of nonlinear equations ⋮ Value function gradient learning for large-scale multistage stochastic programming problems ⋮ A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems ⋮ Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems ⋮ On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems ⋮ Thep-Factor-Lagrange Methods for Degenerate Nonlinear Programming ⋮ Convergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutions ⋮ A Globally Convergent LP-Newton Method

This page was built for publication: Karush-Kuhn-Tucker systems: regularity conditions, error bounds and a class of Newton-type methods