An SQP method for general nonlinear complementarity problems

DOI10.1007/s11766-000-0041-4zbMath0990.90115OpenAlexW2325865744MaRDI QIDQ1595262

Nai-Hua Xiu

Publication date: 25 August 2002

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-000-0041-4

zbMATH Keywords

least squares problemnonlinear complementaritySQP algorithmdamped Gauss-Newton type method

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• Gauss-Newton methods for the complementarity problem
• Convergence analysis of Gauss-Newton methods for the complementarity problem
• An interior point potential reduction method for constrained equations
• A globally convergent Newton method for convex \(SC^ 1\) minimization problems
• A Newton-type method for positive-semidefinite linear complementarity problems
• Smooth Approximations to Nonlinear Complementarity Problems
• Global Methods for Nonlinear Complementarity Problems
• A Positive Algorithm for the Nonlinear Complementarity Problem
• Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems