{"product_id":"primal-dual-interior-point-methods-089871382x","title":"Primal-Dual Interior-Point Methods","description":"\u003cp\u003e\u003cstrong\u003eISBN:\u003c\/strong\u003e 089871382X\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eAuthor:\u003c\/strong\u003e Wright, Stephen J.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eCondition:\u003c\/strong\u003e New\u003c\/p\u003e\u003cp\u003eIn 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.\u003c\/p\u003e","brand":"Mia Karts","offers":[{"title":"Default Title","offer_id":52196655989024,"sku":"NEW089871382X","price":126.43,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0980\/7426\/3840\/files\/51PMQcLtu9L.jpg?v=1786952154","url":"https:\/\/miakarts.com\/products\/primal-dual-interior-point-methods-089871382x","provider":"Miakarts Books","version":"1.0","type":"link"}