Libros importados con hasta 50% OFF + Envío Gratis a todo USA  Ver más

menu

0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional
portada a unified approach to interior point algorithms for linear complementarity problems (in English)
Type
Physical Book
Language
English
Pages
108
ISBN
3540545093
ISBN13
9783540545095

a unified approach to interior point algorithms for linear complementarity problems (in English)

Kojima,Megiddo,Noma,Yoshise (Author) · springer publishing map · Physical Book

a unified approach to interior point algorithms for linear complementarity problems (in English) - kojima,megiddo,noma,yoshise

Physical Book

$ 52.09

$ 54.99

You save: $ 2.90

5% discount
  • Condition: New
It will be shipped from our warehouse between Monday, June 17 and Tuesday, June 18.
You will receive it anywhere in United States between 1 and 3 business days after shipment.

Synopsis "a unified approach to interior point algorithms for linear complementarity problems (in English)"

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews