{"product_id":"9780898713824","title":"Primal-Dual Interior-Point Methods","description":"\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. The major primal-dual algorithms covered 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":"SIAM - SOCIETY FOR INDUSTRIAL AND APPLIED","offers":[{"title":"Default Title","offer_id":47436473466932,"sku":"9780898713824","price":187.0,"currency_code":"AUD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0651\/9390\/2132\/files\/9780898713824.jpg?v=1774739856","url":"https:\/\/woodslane.com.au\/products\/9780898713824","provider":"Woodslane","version":"1.0","type":"link"}