The modulus-based nonsmooth Newton’s method for solving linear complementarity problems
نویسندگان
چکیده
منابع مشابه
Modulus-based GSTS Iteration Method for Linear Complementarity Problems
In this paper, amodulus-based generalized skew-Hermitian triangular splitting (MGSTS) iteration method is present for solving a class of linear complementarity problems with the system matrix either being an H+-matrix with non-positive off-diagonal entries or a symmetric positive definite matrix. The convergence of the MGSTS iterationmethod is studied in detail. By choosing different parameters...
متن کاملModulus-based synchronous multisplitting iteration methods for linear complementarity problems
To reduce the communication among processors and improve the computing time for solving linear complementarity problems, we present a two-step modulus-based synchronous multisplitting iteration method and the corresponding symmetric modulus-based multisplitting relaxation methods. The convergence theorems are established when the system matrix is an H+-matrix, which improve the existing converg...
متن کاملA New Method for Solving Non-Linear Complementarity Problems
The non-linear complementarity problem NLCP is to find a vector z in IR satisfying 0 6 z ⊥ f(z) > 0, where f is a given function. This problem can be solved by several methods but the most of these methods require a lot of arithmetic operations, and therefore, it is too difficult, time consuming, or expensive to find an approximate solution of the exact solution. In this paper we give a new met...
متن کاملProviding a Method for Solving Interval Linear Multi-Objective Problems Based on the Goal Programming Approach
Most research has focused on multi-objective issues in its definitive form, with decision-making coefficients and variables assumed to be objective and constraint functions. In fact, due to inaccurate and ambiguous information, it is difficult to accurately identify the values of the coefficients and variables. Interval arithmetic is appropriate for describing and solving uncertainty and inaccu...
متن کاملNonsmooth Levenberg-Marquardt Type Method for Solving a Class of Stochastic Linear Complementarity Problems with Finitely Many Elements
Abstract: Our purpose of this paper is to solve a class of stochastic linear complementarity problems (SLCP) with finitely many elements. Based on a new stochastic linear complementarity problem function, a new semi-smooth least squares reformulation of the stochastic linear complementarity problem is introduced. For solving the semi-smooth least squares reformulation, we propose a feasible non...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2015
ISSN: 0377-0427
DOI: 10.1016/j.cam.2015.04.006