Convergence analysis of Gauss-Newton methods for the complementarity problem

DOI10.1023/A:1022661202977zbMath0899.90158OpenAlexW75753835MaRDI QIDQ1369053

P. K. Subramanian, Nai-Hua Xiu

Publication date: 7 October 1997

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022661202977

zbMATH Keywords

correctionnonlinear systems of equationsdamped Gauss-Newton algorithm

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (2)

Some non-interior path-following methods based on a scaled central path for linear complementarity problems ⋮ An SQP method for general nonlinear complementarity problems

Cites Work

• Gauss-Newton methods for the complementarity problem
• A globally convergent Newton method for convex \(SC^ 1\) minimization problems
• Equivalence of the Complementarity Problem to a System of Nonlinear Equations
• Nonlinear least squares — the Levenberg algorithm revisited

This page was built for publication: Convergence analysis of Gauss-Newton methods for the complementarity problem