Primal-Dual Interior-Point Methods
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.
|Download links are not available now|
Sponsored High Speed Downloads
9508 dl's @ 3099 KB/sPrimal-Dual Interior-Point Methods [Full Version]
9774 dl's @ 3691 KB/sPrimal-Dual Interior-Point Methods - Fast Download
4477 dl's @ 4231 KB/sPrimal-Dual Interior-Point Methods - Direct Download
DISCLAIMER: None of the files shown here are actually hosted or transmitted by this server. The links are provided solely by this sites users. The administrator of this site cannot be held responsible for what its users post, or any other actions of its users. You may not use this site to distribute or download any material when you do not have the legal rights to do so. It is your own responsibility to adhere to these terms.