A Feasible Semismooth Gauss-Newton Method for Solving a Class of SLCPs

DOI10.4208/jcm.1107-m3559zbMath1265.90309OpenAlexW3141010354MaRDI QIDQ4900532

Chang-Feng Ma

Publication date: 24 January 2013

Published in: Journal of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/jcm.1107-m3559

zbMATH Keywords

convergence analysisGauss-Newton algorithmstochastic linear complementarity problems

Mathematics Subject Classification ID

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

Related Items (1)

Nonsmooth Levenberg-Marquardt type method for solving a class of stochastic linear complementarity problems with finitely many elements

This page was built for publication: A Feasible Semismooth Gauss-Newton Method for Solving a Class of SLCPs