A Feasible Semismooth Gauss-Newton Method for Solving a Class of SLCPs
Abstract
In this paper, we consider a class of the stochastic linear complementarity problems (SLCPs) with finitely many elements. A feasible semismooth damped Gauss-Newton algorithm for the SLCP is proposed. The global and local quadratic convergence of the proposed algorithm are obtained under suitable conditions. Some numerical results are reported in this paper, which confirm the good theoretical properties of the proposed algorithm.
About this article
How to Cite
A Feasible Semismooth Gauss-Newton Method for Solving a Class of SLCPs. (2018). Journal of Computational Mathematics, 30(2), 197-222. https://doi.org/10.4208/jcm.1107-m3559