| 期刊全稱 | A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems | | 影響因子2023 | Masakazu Kojima,Nimrod Megiddo,Akiko Yoshise | | 視頻video | http://file.papertrans.cn/143/142546/142546.mp4 | | 學科分類 | Lecture Notes in Computer Science | | 圖書封面 |  | | 影響因子 | Following Karmarkar‘s 1984 linear programming algorithm,numerous interior-point algorithms have been proposed forvarious mathematical programming problems such as linearprogramming, convex quadratic programming and convexprogramming in general. This monograph presents astudy ofinterior-point algorithms for the linear complementarityproblem (LCP) which is known as a mathematical modelforprimal-dual pairs of linear programs and convex quadraticprograms. A large family of potential reduction algorithmsis presented in a unifiedway for the class of LCPs wherethe underlying matrix has nonnegative principal minors(P0-matrix). This class includes various importantsubclasses such as positive semi-definite matrices,P-matrices, P*-matrices introduced in this monograph, andcolumn sufficient matrices. The family contains not only theusualpotential reduction algorithms but also path followingalgorithms and a damped Newton method for the LCP. The maintopics are global convergence, global linear convergence,and the polynomial-time convergence of potential reductionalgorithms included in the family. | | Pindex | Book 1991 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-8 00:26
發(fā)表于 2025-3-21 19:56:05
