A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems: 538 (Lecture Notes in Computer Science, 538) - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Otras ediciones populares con el mismo título
Resultados de la búsqueda para A Unified Approach to Interior Point Algorithms for...
Imagen de archivo
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems (Lecture Notes in Computer Science)
Librería: GuthrieBooks, Spring Branch, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Nº de ref. del artículo: DA1411949A
Comprar usado
EUR 33,69
Envío por EUR 6,02
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Publicado por
Springer Berlin / Heidelberg, 1991
ISBN 10: 3540545093
ISBN 13: 9783540545095
Antiguo o usado
Tapa blanda
Librería: Better World Books, Mishawaka, IN, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Nº de ref. del artículo: 55881992-6
Comprar usado
EUR 50,76
Gastos de envío gratis
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems (Lecture Notes in Computer Science, 538)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783540545095_new
Comprar nuevo
EUR 57,10
Envío por EUR 13,84
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Publicado por
Springer Berlin Heidelberg Sep 1991, 1991
ISBN 10: 3540545093
ISBN 13: 9783540545095
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540545095
Comprar nuevo
EUR 53,49
Envío por EUR 23,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Publicado por
Springer Berlin Heidelberg, 1991
ISBN 10: 3540545093
ISBN 13: 9783540545095
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: 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. Nº de ref. del artículo: 4893225
Comprar nuevo
EUR 48,37
Envío por EUR 48,99
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Sep 1991, 1991
ISBN 10: 3540545093
ISBN 13: 9783540545095
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Following Karmarkar's 1984 linear programming algorithmnumerous 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 matricesP-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 convergenceand the polynomial-time convergence of potential reductionalgorithms included in the family.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 120 pp. Englisch. Nº de ref. del artículo: 9783540545095
Comprar nuevo
EUR 53,49
Envío por EUR 60,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Publicado por
Springer Berlin Heidelberg, 1991
ISBN 10: 3540545093
ISBN 13: 9783540545095
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540545095
Comprar nuevo
EUR 53,49
Envío por EUR 60,98
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
A unified Approach to interior Point Algorithms for linear Complementarity Problems. (=Lecture Notes in Computer Science Volume 538).
Publicado por
Springer Berlin, 1991
ISBN 10: 3540545093
ISBN 13: 9783540545095
Antiguo o usado
Paperback
Librería: ralfs-buecherkiste, Herzfelde, MOL, Alemania
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Gut. 108 Seiten Guter Zustand/ Good Ex-Library. With numerous figures. ha1034509 Sprache: Englisch Gewicht in Gramm: 230. Nº de ref. del artículo: 170950
Comprar usado
EUR 15,00
Envío por EUR 105,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Librería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 102136622
Comprar nuevo
EUR 50,25
Envío por EUR 70,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen de archivo
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Librería: Buchpark, Trebbin, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: 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. Nº de ref. del artículo: 866613/203
Comprar usado
EUR 35,64
Envío por EUR 105,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles