Convergence analysis of Gauss-Newton methods for the complementarity problem

DOI10.1023/A:1022661202977MaRDI QIDQ1369053zbMATH OpenOpenAlexFDO

Authors P. K. Subramanian, Naihua 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

correctiondamped Gauss-Newton algorithmnonlinear systems of equations

Mathematics Subject Classification ID

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

Recommendations

• Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems
• scientific article; zbMATH DE number 7326968
• scientific article; zbMATH DE number 1950396
• Convergence analysis of a proximal Gauss-Newton method
• scientific article; zbMATH DE number 706825
• Convergence of Gauss-Newton method for convex composite optimization. II: Applications
• scientific article; zbMATH DE number 1839529
• Convergence analysis of the general Gauss-Newton algorithm
• On convergence of the Gauss-Newton method for convex composite optimization.
• Gauss-Newton methods for the complementarity problem

Cites work

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

Cited in

(10)

• Gauss-Newton methods for the complementarity problem
• An SQP method for general nonlinear complementarity problems
• Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
• scientific article; zbMATH DE number 706825 (Why is no real title available?)
• scientific article; zbMATH DE number 4113873 (Why is no real title available?)
• scientific article; zbMATH DE number 1839529 (Why is no real title available?)
• On convergence of the Gauss-Newton method for convex composite optimization.
• Improved modulus-based matrix splitting iteration methods for a class of horizontal implicit complementarity problems
• Two variants of robust two-step modulus-based matrix splitting iteration methods for mixed-cell-height circuit legalization problem
• Some non-interior path-following methods based on a scaled central path for linear complementarity problems

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

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