- Free Articles
- Reactive Scheduling of Batch Processes Encyclopedia of Optimization
- Variational methods in shape analysis Handbook of Mathematical Methods in Imaging
- History of Geomathematics: Navigation on Sea Handbook of Geomathematics
- Geomagnetic Field: Satellite Data Handbook of Geomathematics
- From Omnipotent to Omnipresent Maps Handbook of Geomathematics
**More Free Articles**

This is the free portion of the full article.
The full article
is available to licensed users only.

How do I get access?

# Splitting Method for Linear Complementarity Problems

### Article Outline

Keywords

Keywords LCP - Splitting method - SOR method

Splitting methods were originally proposed as a generalization of the classical SOR method for solving a system of linear equations [8,25], and in the late 1970s they were extended to the linear complementarity problem (LCP; cf. Linear complementarity problem) [1,2, Chap. 5], [10,13,18]. These methods are iterative and are best suited for problems in which exploitation of sparsity is important, such as large sparse linear programs and the discretization of certain elliptic boundary value problems with obstacle.

*x*= (

*x*

_{1}, …,

*x*

_{n}) ∊

**R**

^{n}solving the following system of nonlinear equations:

(1) |

*M*= [

*m*

_{ij}]

_{i, j = 1, …, n}∊

**R**

^{n×n},

*q*= (

*q*

_{1}, …,

*q*

_{n}) ∊

**R**

^{n}and the lower bound