Kojima masakazu (14 resultados)

Condición: As New. Unread book in perfect condition.

Condición: New.

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.…

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.…

Condición: Fine. Number of books: 1.

Condición: Fine. The book is in fine condition.

Condición: Fine. The book is in fine condition.

Condición: Fine. The book is in fine condition.

Condición: Fine. The book is in fine condition.

Condición: Fine. Number of books: 1.

Condición: Fine. The book is in fine condition.

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.…

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. …

Taschenbuch. Condición: 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.…