Primal-dual Interior-point Methods

Free Shipping over $50

and free returns nationwide (rentals only)

14-day

Money Back Guarantee

Primal-dual Interior-point Methods

ISBN : 9780898713824
Publisher : Society for Industrial & Applied Mathematics,U.S.
Author(s) :
Publication Date :
Overview 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.

$131.60

BackOrder

Leaves warehouse in 14 - 21 business days

List Price : $155.00

Savings : $23.40