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

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

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

Formato

Libro Físico

Editorial

Springer

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 · Libro Físico

Libro Nuevo Importado

Envío: 16 a 23 días háb.

$ 108.45$ 65.07

-40%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 65.07

Llega entre el 07 Sep y el 18 Sep a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

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.