Mohlo by se vám také líbit

Více informací o knize A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 168 bodů

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

Parametry knihy

Zařazení knihy Knihy v angličtině Computing & information technology Computer science Mathematical theory of computation

• Plný název: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
• Autor: Masakazu Kojima, Nimrod Megiddo, Toshihito Noma, Akiko Yoshise
• Jazyk: Angličtina
• Vazba: Brožovaná
• Počet stran: 112
• EAN: 9783540545095
• ISBN: 3540545093
• ID: 05274210
• Nakladatelství: Springer, Berlin
• Hmotnost: 212 g
• Rozměry: 233 × 155 × 6 mm
• Rok vydání: 1991

Oblíbené z jiného soudku

---

---

---