Solving equations via the trust region and its application to a class of stochastic linear complementarity problems
Equations with box constraints are applied in many fields, for example the complementarity problem. After studying the existing methods, we find that quadratic convergence of majority algorithms is based on the solvability of the equations. But whether the equations are solvable is previously unknown. So, it is necessary to design an algorithm which has fast quadratic convergence. The quadratic convergence does not depend on the solvability of the equations. In this paper, we propose a new method for solving equations. The global and local quadratic convergence of the proposed algorithm are established under some suitable assumptions. We apply the proposed algorithm to a class of stochastic linear complementarity problems. Numerical results show that our method is valid. Crown Copyright (C) 2011 Published by Elsevier Ltd. All rights reserved.
equations stochastic linear complementarity trust region method semi-smooth