首页 | 本学科首页   官方微博 | 高级检索  
     


A smoothing Levenberg-Marquardt algorithm for solving a class of stochastic linear complementarity problem
Authors:Yajun Xie  Changfeng Ma
Affiliation:a School of Mathematics and Computer Science, Fujian Normal University, Fuzhou 350007,China
b Department of Mathematics, Fujian Jiangxia College, Fuzhou 350108, China
Abstract:In this paper, it is considered for a class of stochastic linear complementarity problems (SLCPs) with finitely many elements. A smoothing Levenberg-Marquardt algorithm is proposed for solving the SLCP. Under suitable conditions, the global convergence and local quadratic convergence of the proposed algorithm is given. Some numerical results are reported in this paper, which confirms the good theoretical properties of the proposed algorithm.
Keywords:Stochastic linear complementarity problems   Smoothing Levenberg-Marquardt algorithm   Convergence analysis   Numerical results
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号