Newton-Type Methods for Optimization Problems without Constraint Qualifications

From MaRDI portal
Publication:4652002

DOI10.1137/S1052623403427264zbMath1106.90077MaRDI QIDQ4652002

Alexey F. Izmailov, Mikhail V. Solodov

Publication date: 23 February 2005

Published in: SIAM Journal on Optimization (Search for Journal in Brave)




Related Items (20)

Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraintsA globally convergent regularized interior point method for constrained optimizationLocal convergence analysis of Newton's method for solving strongly regular generalized equationsModel-based principal components of correlation matricesConvergence of a stabilized SQP method for equality constrained optimizationAn LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutionsNewton-type methods for constrained optimization with nonregular constraintsThe Dines theorem and some other properties of quadratic mappingsStabilized SQP revisitedA note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systemsStabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problemsAn optimization method for overdetermined kinematic problems formulated with natural coordinatesNew implementations of the 2-factor methodOn attraction of Newton-type iterates to multipliers violating second-order sufficiency conditionsA stabilized SQP method: superlinear convergenceSubspace-stabilized sequential quadratic programmingThep-Factor-Lagrange Methods for Degenerate Nonlinear ProgrammingConvergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutionsA Globally Convergent LP-Newton Method2-factor Newton method for solving constrained optimization problems with a degenerate Kuhn-Tucker system


Uses Software



This page was built for publication: Newton-Type Methods for Optimization Problems without Constraint Qualifications