Newton-Type Methods for Optimization Problems without Constraint Qualifications

DOI10.1137/S1052623403427264MaRDI QIDQ4652002zbMATH OpenFDO

Authors A. F. Izmailov, M. V. Solodov

Publication date 23 February 2005

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

zbMATH Keywords

regularityNewton methodsecond-order sufficiencysingular-value decompositionconstraints degeneracymathematical programs with complementarity constraints (MPCC)

Mathematics Subject Classification ID

Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• On the application of Newton-type methods to Fritz John optimality conditions
• Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints
• A special newton-type optimization method
• An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
• On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions

Cited in

(22)

• Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints
• An optimization method for overdetermined kinematic problems formulated with natural coordinates
• Model-based principal components of correlation matrices
• Newton-Type Methods for Optimization and Variational Problems
• On the application of Newton-type methods to Fritz John optimality conditions
• Subspace-stabilized sequential quadratic programming
• Convergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutions
• Stabilized SQP revisited
• The Dines theorem and some other properties of quadratic mappings
• A stabilized SQP method: superlinear convergence
• A globally convergent LP-Newton method
• Convergence of a stabilized SQP method for equality constrained optimization
• An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions
• Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
• A globally convergent regularized interior point method for constrained optimization
• Newton-type methods for constrained optimization with nonregular constraints
• Local convergence analysis of Newton's method for solving strongly regular generalized equations
• A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems
• New implementations of the 2-factor method
• Thep-Factor-Lagrange Methods for Degenerate Nonlinear Programming
• 2-factor Newton method for solving constrained optimization problems with a degenerate Kuhn-Tucker system
• On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions

Describes a project that uses

Uses Software

• MacMPEC

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4652002)