欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
提出求解一类随机线性互补问题的一个L-M算法,利用NCP函数将随机线性互补问题转化为无约束最小化问题,通过非单调L-M算法来求解无约束最小化问题.在适当的假设下,证明了该算法的全局收敛性.
英文摘要：
An L-M algorithm for a class of stochastic linear complementarity problems is pro- posed. The stochastic linear complementarity problems will be turned into to unconstrain minimiza- tion problems, employing a nonmonotone levenberg-marquardt method for the minimization prob- lem. The global convergence of the algorithm is proved under some suitable assumptions.
同期刊论文项目
同项目期刊论文
A new relaxed extragradient-like algorithm for approaching common solutions of generalized mixed equ
The convergence analysis of the projection methods for a system of generalized relaxed cocoercive va
Numerical study of the nonlinear combined sine-cosine -Gordon equation with the lattice Boltzmann me
The inversion-free iterative methods for solving the nonlinear matrix equation X+A*X^{-1}A+B*X^{-1}B
A new smoothing Broyden-like method for solving nonlinear complementarity problem with a P (0)-funct
A SMOOTHING TRUST REGION METHOD FOR NCPS BASED ON THE SMOOTHING GENERALIZED FISCHER-BURMEISTER FUNCT
Superlinear/quadratic smoothing Broyden-like method for the generalized nonlinear complementarity pr
The Inversion-Free Iterative Methods for Solving the Nonlinear Matrix Equation X+A^{H}X^{-1}A+B^{H}X
On the convergence analysis of two-step modulus-based matrix splitting iteration method for linear c
On normal and skew-Hermitian splitting iteration methods for large sparse continuous Sylvester equat
A preconditioned nested splitting conjugate gradient iterative method for the large sparse generaliz
Iterative method to solve the generalized coupled Sylvester-transpose linear matrix equations over r
期刊信息
位置：