Name: a unified approach to interior point algorithms for linear complementarity problems (en Inglés)
Price: 70350.00 CLP
Availability: InStock
Author: kojima,megiddo,noma,yoshise
ISBN: 9783540545095

portada a unified approach to interior point algorithms for linear complementarity problems (en Inglés)

Formato

Libro Físico

Editorial

springer publishing map

Autor

kojima,megiddo,noma,yoshise

Idioma

Inglés

N° páginas

108

ISBN

3540545093

ISBN13

9783540545095

Categorías

Matemáticas aplicadas

a unified approach to interior point algorithms for linear complementarity problems (en Inglés)

Kojima,Megiddo,Noma,Yoshise (Autor) · springer publishing map · Libro Físico

Libro Nuevo

$ 70.350

$ 127.900

Ahorras: $ 57.550

45% descuento

Envío normal

Origen: Estados Unidos (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Viernes 21 de Junio y el Miércoles 03 de Julio.

Lo recibirás en cualquier lugar de Chile entre 1 y 3 días hábiles luego del envío.

Reseña del libro "a unified approach to interior point algorithms for linear complementarity problems (en Inglés)"

following karmarkars 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.