Published by Springer, 1991
ISBN 10: 3540545093 ISBN 13: 9783540545095
Seller: Irish Booksellers, Portland, ME, U.S.A.
Condition: Good. SHIPS FROM USA. Used books have different signs of use and do not include supplemental materials such as CDs, Dvds, Access Codes, charts or any other extra material. All used books might have various degrees of writing, highliting and wear and tear and possibly be an ex-library with the usual stickers and stamps. Dust Jackets are not guaranteed and when still present, they will have various degrees of tear and damage. All images are Stock Photos, not of the actual item. book.
Published by Springer, 1991
ISBN 10: 3540545093 ISBN 13: 9783540545095
Seller: GuthrieBooks, Spring Branch, TX, U.S.A.
Paperback. Condition: Very Good. 0387545093 Ex-library paperback in very nice condition with the usual markings and attachments.
Published by Springer, 1991
ISBN 10: 3540545093 ISBN 13: 9783540545095
Seller: booksXpress, Bayonne, NJ, U.S.A.
Soft Cover. Condition: new.
Published by Springer, 1991
ISBN 10: 3540545093 ISBN 13: 9783540545095
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New.
Published by Springer, 1991
ISBN 10: 3540545093 ISBN 13: 9783540545095
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Published by Springer, 1991
ISBN 10: 3540545093 ISBN 13: 9783540545095
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Published by Springer, 1991
ISBN 10: 3540545093 ISBN 13: 9783540545095
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Springer Berlin Heidelberg Sep 1991, 1991
ISBN 10: 3540545093 ISBN 13: 9783540545095
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
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.
Published by Springer Berlin Heidelberg, 1991
ISBN 10: 3540545093 ISBN 13: 9783540545095
Seller: Buchpark, Trebbin, Germany
Condition: Gut. Zustand: Gut - Gebrauchs- und Lagerspuren. Außen: verschmutzt. Innen: Seiten vergilbt. Aus der Auflösung einer renommierten Bibliothek. Kann Stempel beinhalten. | Seiten: 120 | Sprache: Englisch | Produktart: Bücher.
Published by Springer, 1991
ISBN 10: 3540545093 ISBN 13: 9783540545095
Seller: GreatBookPricesUK, Castle Donington, DERBY, United Kingdom
Condition: New.
Seller: Librairie Chat, Beijing, China
Condition: Fine. The book is in fine condition.
Condition: Fine. The book is in fine condition.
Published by Springer, 1991
ISBN 10: 3540545093 ISBN 13: 9783540545095
Seller: GreatBookPricesUK, Castle Donington, DERBY, United Kingdom
Condition: As New. Unread book in perfect condition.
Published by Springer Berlin Heidelberg, 1991
ISBN 10: 3540545093 ISBN 13: 9783540545095
Seller: AHA-BUCH GmbH, Einbeck, Germany
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.
Published by Springer Berlin Heidelberg, 1991
ISBN 10: 3540545093 ISBN 13: 9783540545095
Seller: moluna, Greven, Germany
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.