New multiplier method for solving linear complementarity problems
Ulji , Guoqing Chen
Front. Math. China ›› 2006, Vol. 1 ›› Issue (3) : 368 -381.
New multiplier method for solving linear complementarity problems
A new multiplier method for solving the linear complementarity problem LCP(q, M) is proposed. By introducing a Lagrangian of LCP(q, M), a new smooth merit function ϑ(x, λ) for LCP(q, M) is constructed. Based on it, a simple damped Newton-type algorithm with multiplier self-adjusting step is presented. When M is a P-matrix, the sequence {ϑ(xk, λk)} (where {(xk, λk)} is generated by the algorithm) is globally linearly convergent to zero and convergent in a finite number of iterations if the solution is degenerate. Numerical results suggest that the method is highly efficient and promising.
linear complementarity problem / multiplier method / global linear convergence / finite convergence / 90C33
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
/
| 〈 |
|
〉 |