Modulus-based matrix splitting iteration methods for a class of implicit complementarity problems. (English) Zbl 1413.65060
The authors extend a class of modulus-based matrix splitting iteration method from the linear complementary problem to the implicit one. The main idea is to obtain an equivalent fixed-point equation through a certain transformation of variables and then to solve the fixed-point equation by applying modulus-based matrix splitting iteration methods. Convergence results are proved and demonstrated through numerical tests.
Reviewer: Liu Xinguo (Qingdao)
MSC:
| 65F10 | Iterative numerical methods for linear systems |
| 90C33 | Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) |
Software:
MatlabReferences:
| [1] | CottleR, PangJ‐S. Stone r the Linear Complementarity Problem. Academic Press: San Diego, 1992. · Zbl 0757.90078 |
| [2] | FerriM, PangJ‐S. Engineering and economic applications of complementarity problems. SIAM Review. 1997; 39: 669-713. · Zbl 0891.90158 |
| [3] | BaiZ‐Z. On the monotone convergence of the projected iteration methods for linear complementarity problem. Numerical Mathematics, A Journal of Chinese Universities (English Series). 1996; 5: 228-233. · Zbl 0926.65059 |
| [4] | CryerC. The solution of a quadratic programming using systematic overrelaxation. SIAM Journal on Control and Optimization. 1971; 9: 385-392. · Zbl 0216.54603 |
| [5] | AhnBH. Solution of nonsymmetric linear complementarity problems by iterative methods. Journal of Optimization Theory and Applications. 1981; 33: 175-185. · Zbl 0422.90079 |
| [6] | DongJ‐L, JiangM‐Q. A modified modulus method for symmetric positive‐definite linear complementarity problems. Numerical Linear Algebra with Applications. 2009; 16: 129-143. · Zbl 1224.65152 |
| [7] | MangasarianO. Solution of symmetric linear complementarity problems by iterative methods. Journal of Optimization Theory and Applications. 1997; 22: 465-485. · Zbl 0341.65049 |
| [8] | PangJ‐S. On the convergence of a basic iterative method for the implicit complementarity problems. Journal of Optimization Theory and Applications. 1982; 37: 149-162. · Zbl 0482.90084 |
| [9] | BaiZ‐Z. IMA Journal of Numerical Analysis. 1998; 18: 509-518. · Zbl 0914.65072 |
| [10] | BaiZ‐Z. On the convergence of the multisplitting methods for the linear complementarity problem. SIAM Journal on Matrix Analysis and Applications. 1999; 21: 67-78. · Zbl 0942.65059 |
| [11] | BaiZ‐Z, EvansD. International Journal of Computer Mathematics. 1997; 63: 309-326. · Zbl 0876.90086 |
| [12] | BaiZ‐Z, EvansD. Matrix multisplitting methods with applications to linear complementarity problems: parallel synchronous and chaotic methods. Reseaux et Systemes Repartis: Calculateurs Paralleles. 2001; 13: 125-154. |
| [13] | BaiZ‐Z, EvansD. Matrix multisplitting methods with applications to linear complementarity problems: parallel asynchronous methods. International Journal of Computer Mathematics. 2002; 79: 205-232. · Zbl 1011.65033 |
| [14] | BaiZ‐Z, ZhangL‐L. Modulus‐based synchronous multisplitting iteration methods for linear complementarity problems. Numerical Linear Algebra with Applications. 2013; 20: 425-439. · Zbl 1313.65131 |
| [15] | BaiZ‐Z. Modulus‐based matrix splitting iteration methods for linear complementarity problems. Numerical Linear Algebra with Applications. 2010; 17: 917-933. · Zbl 1240.65181 |
| [16] | LiW. A general modulus‐based matrix splitting method for linear complementarity problems of H‐matrices. Applied Mathematics Letters. 2013; 26: 1159-1164. · Zbl 1311.65071 |
| [17] | ZhangL‐L. Two‐step modulus‐based matrix splitting iteration methods for linear complementarity problems. Numerical Algorithms. 2011; 57: 83-99. · Zbl 1219.65057 |
| [18] | ZhangL‐L. Two‐stage multisplitting iteration methods using modulus‐based matrix splitting as inner iteration for linear complementarity problems. Journal of Optimization Theory and Applications. 2014; 160: 189-203. · Zbl 1334.90181 |
| [19] | ZhangL‐L, RenZ‐R. Improved convergence theorems of modulus‐based matrix splitting iteration methods for linear complementarity problems. Applied Mathematics Letters. 2013; 26: 638-642. · Zbl 1266.65097 |
| [20] | ZhengN, YinJ‐F. Convergence of accelerated modulus‐based matrix splitting iteration methods for linear complementarity problem with an H_+‐matrix. Journal of Computational and Applied Mathematics. 2014; 260: 281-293. · Zbl 1293.65051 |
| [21] | PangJ‐S. The Implicit Complemenarity Problem. Academic Press: San Diego, 1992. |
| [22] | NoorM. Linear quasi‐complementarity problem. Utilitas Mathematica. 1985; 27: 249-260. · Zbl 0588.90087 |
| [23] | NoorM. The quasi‐complementarity problem. Journal of Optimization Theory and Applications. 1988; 130: 344-353. · Zbl 0645.90086 |
| [24] | NoorM. Fixed point approach for complementarity problems. Journal of Optimization Theory and Applications. 1988; 133: 437-448. · Zbl 0649.65037 |
| [25] | ZhanW‐P, ZhouS‐Z, ZengJ‐P. Iterative methods for a kind of quasi‐complementarity problems. Acta Mathematicae Applicatae Sinica. 2000; 23: 551-556. · Zbl 0985.90088 |
| [26] | FischerA. A special Newton‐type optimization method. Optimization. 1992; 24: 296-284. · Zbl 0814.65063 |
| [27] | KanzowC, FukushimaM. Equivalence of the generalized complementarity problem to differentiable unconstrained minimization. Journal of Computational and Applied Mathematics. 1996; 90: 581-683. · Zbl 0866.90124 |
| [28] | YuanQ. Implicit complementarity problem. Master’s Thesis, Nanjing University of Aeronautics and Astronautics: Nanjing, 2002. |
| [29] | YuanQ, YinH‐Y. Stationary point of the minimization reformulations of implicit complementarity problems. Numerical Mathematics A Journal of Chinese Universities. 2009; 31: 11-18. · Zbl 1183.90430 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
