Контакт
Как се пазарува?
Доставка
Наръчник за пазаруване
Primal-dual Interior-point Methods
Английски език
222 b
Подготвяме
Издание 03. 07. 2026
До 30 дни за връщане на стоки
Клиентите са закупили също
/
С меки корици
19.75
€
38.62 лв
/
С меки корици
22.69
€
44.37 лв
In the past decade, primal-dual algorithms have emerged as the most important and useful algorithms from the interior-point class. This book presents the major primal-dual algorithms for linear programming in straightforward terms. A thorough description of the theoretical properties of these methods is given, as are a discussion of practical and computational aspects and a summary of current software. This is an excellent, timely, and well-written work. The major primal-dual algorithms covered in this book are path-following algorithms (short- and long-step, predictor-corrector), potential-reduction algorithms, and infeasible-interior-point algorithms. A unified treatment of superlinear convergence, finite termination, and detection of infeasible problems is presented. Issues relevant to practical implementation are also discussed, including sparse linear algebra and a complete specification of Mehrotra's predictor-corrector algorithm. Also treated are extensions of primal-dual algorithms to more general problems such as monotone complementarity, semidefinite programming, and general convex programming problems.
Информация за книгата
Английски език
Подарете тази книга днес
Лесно е
1 Добавете книгата в количката си и изберете Доставка като подарък 2 В замяна ще ви изпратим ваучер 3 Книгата ще пристигне на адреса на получателяМоже би ще Ви заинтересува
Здравейте! Аз съм Libroamiko, вашият книжен съветник.
Как мога да ви помогна?