Zum Hauptinhalt springen Zur Suche springen Zur Hauptnavigation springen
Beschreibung
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.
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.
Zusammenfassung
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.
Inhaltsverzeichnis
Summary.- The class of linear complementarity problems with P 0-matrices.- Basic analysis of the UIP method.- Initial points and stopping criteria.- A class of potential reduction algorithms.- Proofs of convergence theorems.
Details
Erscheinungsjahr: 1991
Fachbereich: Arithmetik & Algebra
Genre: Mathematik, Medizin, Naturwissenschaften, Technik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Inhalt: viii
112 S.
ISBN-13: 9783540545095
ISBN-10: 3540545093
Sprache: Englisch
Einband: Kartoniert / Broschiert
Autor: Kojima, Masakazu
Megiddo, Nimrod
Noma, Toshihito
Yoshise, Akiko
Hersteller: Springer
Springer-Verlag GmbH
Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, D-69121 Heidelberg, juergen.hartmann@springer.com
Maße: 235 x 155 x 7 mm
Von/Mit: Masakazu Kojima (u. a.)
Erscheinungsdatum: 25.09.1991
Gewicht: 0,195 kg
Artikel-ID: 102136622

Ähnliche Produkte

Taschenbuch