A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems: 538 (Lecture Notes in Computer Science, 538) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for A Unified Approach to Interior Point Algorithms for...
Stock Image
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems (Lecture Notes in Computer Science, 538)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540545095_new
Buy New
£ 48.98
£ 11.98 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Published by
Springer Berlin Heidelberg Sep 1991, 1991
ISBN 10: 3540545093
ISBN 13: 9783540545095
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 a study ofinterior-point algorithms for the linear complementarityproblem (LCP) which is known as a mathematical model forprimal-dual pairs of linear programs and convex quadraticprograms. A large family of potential reduction algorithmsis presented in a unified way 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 theusual potential 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. 120 pp. Englisch. Seller Inventory # 9783540545095
Seller Image
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Published by
Springer Berlin Heidelberg, 1991
ISBN 10: 3540545093
ISBN 13: 9783540545095
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 convexprogrammin. Seller Inventory # 4893225
Buy New
£ 43.03
£ 42.32 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Published by
Springer, Springer Sep 1991, 1991
ISBN 10: 3540545093
ISBN 13: 9783540545095
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This monograph presents a study of interior-point algorithms for the linear complementarity problem, known as a mathematical model for primal-dual pairs of linear programs and convex quadratic programs. A large class of potential reduction algorithms is presented in a unified way.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 120 pp. Englisch. Seller Inventory # 9783540545095
Seller Image
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Published by
Springer Berlin Heidelberg, 1991
ISBN 10: 3540545093
ISBN 13: 9783540545095
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 a study ofinterior-point algorithms for the linear complementarityproblem (LCP) which is known as a mathematical model forprimal-dual pairs of linear programs and convex quadraticprograms. A large family of potential reduction algorithmsis presented in a unified way 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 theusual potential 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. Seller Inventory # 9783540545095
Stock Image
A unified Approach to interior Point Algorithms for linear Complementarity Problems. (=Lecture Notes in Computer Science Volume 538).
Seller: ralfs-buecherkiste, Herzfelde, MOL, Germany
Seller rating 5 out of 5 stars
Paperback. Condition: Gut. 108 Seiten Guter Zustand/ Good Ex-Library. With numerous figures. ha1034509 Sprache: Englisch Gewicht in Gramm: 230. Seller Inventory # 170950
Seller Image
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems | Masakazu Kojima (u. a.) | Taschenbuch | viii | Englisch | 1991 | Springer | EAN 9783540545095 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 102136622
Stock Image
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Seller: Buchpark, Trebbin, Germany
Seller rating 5 out of 5 stars
Condition: Gut. Zustand: Gut | Sprache: Englisch | Produktart: Bücher | 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 a study ofinterior-point algorithms for the linear complementarityproblem (LCP) which is known as a mathematical model forprimal-dual pairs of linear programs and convex quadraticprograms. A large family of potential reduction algorithmsis presented in a unified way 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 theusual potential 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. Seller Inventory # 866613/203