Kontakt
Kako nakupovati
Dostava
Svetovalec pri nakupu
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Angleščina
118 b
Do 30 dni za vračilo
Drugi so kupili tudi
/
Mehka
31.79
€
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.
O knjigi
Angleščina
Podarite to knjigo še danes
To je povsem preprosto
1 Dodajte knjigo v košarico in izberite dostavo kot darilo 2 V zameno vam bomo poslali kupon 3 Knjiga bo dostavljena na naslov obdarovancaMorda bi vas zanimalo tudi
/
Mehka
13.26
€
Pozdravljeni! Sem Libroamiko, vaš knjižni svetovalec.
Kako vam lahko pomagam?