A Unified Approach To Interior Point Algorithms For Linear Complementarity Problems
Download and Read A Unified Approach To Interior Point Algorithms For Linear Complementarity Problems full books in PDF, ePUB, and Kindle. Read online free A Unified Approach To Interior Point Algorithms For Linear Complementarity Problems ebook anywhere anytime directly on your device. We cannot guarantee that every ebooks is available!
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Author | : Masakazu Kojima |
Publisher | : Springer Science & Business Media |
Total Pages | : 124 |
Release | : 1991-09-25 |
Genre | : Language Arts & Disciplines |
ISBN | : 9783540545095 |
Download A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems Book in PDF, Epub and Kindle
Following Karmarkar's 1984 linear programming algorithm, numerous interior-point algorithms have been proposed for various mathematical programming problems such as linear programming, convex quadratic programming and convex programming in general. This monograph presents a study of interior-point algorithms for the linear complementarity problem (LCP) which is known as a mathematical model for primal-dual pairs of linear programs and convex quadratic programs. A large family of potential reduction algorithms is presented in a unified way for the class of LCPs where the underlying matrix has nonnegative principal minors (P0-matrix). This class includes various important subclasses such as positive semi-definite matrices, P-matrices, P*-matrices introduced in this monograph, and column sufficient matrices. The family contains not only the usual potential reduction algorithms but also path following algorithms and a damped Newton method for the LCP. The main topics are global convergence, global linear convergence, and the polynomial-time convergence of potential reduction algorithms included in the family.
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems Related Books
Pages: 124
Pages: 122
Pages: 544
Pages: 285
Pages: 214