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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Versand:
EUR 29,00
Von Deutschland nach USA
Versand:
Gratis
Innerhalb der USA
Anbieter: ralfs-buecherkiste, Herzfelde, MOL, Deutschland
Paperback. Zustand: Gut. 108 Seiten Guter Zustand/ Good Ex-Library. With numerous figures. ha1034509 Sprache: Englisch Gewicht in Gramm: 230. Bestandsnummer des Verkäufers 170950
Anzahl: 1 verfügbar
Anbieter: Irish Booksellers, Portland, ME, USA
Zustand: 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. Bestandsnummer des Verkäufers 28-3540545093-G
Anzahl: 1 verfügbar
Anbieter: GuthrieBooks, Spring Branch, TX, USA
Paperback. Zustand: Very Good. 0387545093 Ex-library paperback in very nice condition with the usual markings and attachments. Bestandsnummer des Verkäufers DA1411949
Anzahl: 1 verfügbar
Anbieter: booksXpress, Bayonne, NJ, USA
Soft Cover. Zustand: new. Bestandsnummer des Verkäufers 9783540545095
Anzahl: 10 verfügbar
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar3113020170056
Anzahl: Mehr als 20 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New. Bestandsnummer des Verkäufers 5906419-n
Anzahl: 5 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 5906419
Anzahl: 5 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Bestandsnummer des Verkäufers ria9783540545095_lsuk
Anzahl: Mehr als 20 verfügbar
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783540545095
Anzahl: 2 verfügbar
Anbieter: Buchpark, Trebbin, Deutschland
Zustand: 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. Bestandsnummer des Verkäufers 866613/203
Anzahl: 1 verfügbar