Convergence of SAOR Method for the Linear Complementarity Problems
نویسندگان
چکیده
منابع مشابه
Improved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملThe Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems
A non{interior path following algorithm is proposed for the linear complementarity problem. The method employs smoothing techniques introduced by Kanzow. If the LCP is P 0 +R 0 and satisses a non{degeneracy condition due to Fukushima, Luo, and Pang, then the algorithm is globally linearly convergent. As with interior point path following methods, the convergence theory relies on the notion of a...
متن کاملA Projected Algebraic Multigrid Method for Linear Complementarity Problems
We present an algebraic version of an iterative multigrid method for obstacle problems, called projected algebraic multigrid (PAMG) here. We show that classical algebraic multigrid algorithms can easily be extended to deal with this kind of problem. This paves the way for efficient multigrid solution of obstacle problems with partial differential equations arising, for example, in financial eng...
متن کامل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...
متن کاملExpected Residual Minimization Method for Stochastic Linear Complementarity Problems
This paper presents a new formulation for the stochastic linear complementarity problem (SLCP), which aims at minimizing an expected residual defined by an NCP function. We generate observations by the quasi-Monte Carlo methods and prove that every accumulation point of minimizers of discrete approximation problems is a minimum expected residual solution of the SLCP. We show that a sufficient c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering and Manufacturing
سال: 2012
ISSN: 2305-3631
DOI: 10.5815/ijem.2012.04.10