A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems

A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Author :
Publisher : Springer Science & Business Media
Total Pages : 124
Release :
ISBN-10 : 3540545093
ISBN-13 : 9783540545095
Rating : 4/5 (095 Downloads)

Book Synopsis A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems by : Masakazu Kojima

Download or read book A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems written by Masakazu Kojima and published by Springer Science & Business Media. This book was released on 1991-09-25 with total page 124 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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

A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Language: en
Pages: 124
Authors: Masakazu Kojima
Categories: Language Arts & Disciplines
Type: BOOK - Published: 1991-09-25 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

Following Karmarkar's 1984 linear programming algorithm, numerous interior-point algorithms have been proposed for various mathematical programming problems suc
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Language: en
Pages: 122
Authors: Masakazu Kojima
Categories:
Type: BOOK - Published: 2014-01-15 - Publisher:

DOWNLOAD EBOOK

Primal-dual Interior-Point Methods
Language: en
Pages: 309
Authors: Stephen J. Wright
Categories: Interior-point methods
Type: BOOK - Published: 1997-01-01 - Publisher: SIAM

DOWNLOAD EBOOK

In the past decade, primal-dual algorithms have emerged as the most important and useful algorithms from the interior-point class. This book presents the major
Interior Point Algorithms
Language: en
Pages: 440
Authors: Yinyu Ye
Categories: Mathematics
Type: BOOK - Published: 2011-10-11 - Publisher: John Wiley & Sons

DOWNLOAD EBOOK

The first comprehensive review of the theory and practice of one oftoday's most powerful optimization techniques. The explosive growth of research into and deve
Interior Point Methods for Linear Optimization
Language: en
Pages: 501
Authors: Cornelis Roos
Categories: Mathematics
Type: BOOK - Published: 2006-02-08 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

The era of interior point methods (IPMs) was initiated by N. Karmarkar’s 1984 paper, which triggered turbulent research and reshaped almost all areas of optim