Mohlo by sa vám tiež páčiť

Viac informácií o knihe A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 175 bodov

Anotácia knihy

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

Parametre knihy

Zaradenie knihy Knihy po anglicky Computing & information technology Computer science Mathematical theory of computation

• Celý názov: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
• Autor: Masakazu Kojima, Nimrod Megiddo, Toshihito Noma, Akiko Yoshise
• Jazyk: Angličtina
• Väzba: Brožovaná
• Počet strán: 112
• EAN: 9783540545095
• ISBN: 3540545093
• ID: 05274210
• Nakladateľ: Springer, Berlin
• Hmotnosť: 212 g
• Rozmery: 233 × 155 × 6 mm
• Rok vydania: 1991

Obľúbené z iného súdka

---

---

---