{"product_id":"interior-point-polynomial-methods-in-convex-programming-paperback-softback-9780898715156","title":"Interior Point Polynomial Methods in Convex Programming (Paperback \/ softback) 9780898715156","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eInterior Point Polynomial Methods in Convex Programming\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cem\u003eIn this book, the authors describe the first unified theory of polynomial-time interior-point methods.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eYurii Nesterov (Author), Arkadii Nemirovskii (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780898715156, Society for Industrial and Applied Mathematics\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePaperback \/ softback, published 30 June 2006\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e414 pages\u003cbr\u003e22.9 x 15.2 x 2 cm, 0.728 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eWritten for specialists working in optimization, mathematical programming, or control theory. The general theory of path-following and potential reduction interior point polynomial time methods, interior point methods, interior point methods for linear and quadratic programming, polynomial time methods for nonlinear convex programming, efficient computation methods for control problems and variational inequalities, and acceleration of path-following methods are covered. In this book, the authors describe the first unified theory of polynomial-time interior-point methods. Their approach provides a simple and elegant framework in which all known polynomial-time interior-point methods can be explained and analyzed; this approach yields polynomial-time interior-point methods for a wide variety of problems beyond the traditional linear and quadratic programs.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e1. Self-concordant functions and Newton method\u003cbr\u003e 2. Path-following interior-point methods\u003cbr\u003e 3. Potential Reduction interior-point methods\u003cbr\u003e 4. How to construct self- concordant barriers\u003cbr\u003e 5. Applications in convex optimization\u003cbr\u003e 6.Variational inequalities with monotone operators\u003cbr\u003e 7. Acceleration for linear and linearly constrained quadratic problems\u003cbr\u003e Bibliography\u003cbr\u003e Appendix 1\u003cbr\u003e Appendix 2.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Miscellaneous items [\u003ca title=\"See our other books on Miscellaneous items\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Miscellaneous%20items%20%5BWZ%5D%22\"\u003eWZ\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"MP–SIA SIAM – Society for Industrial and Applied M","offers":[{"title":"Brand New","offer_id":52685349388568,"sku":"9780898715156","price":96.35,"currency_code":"GBP","in_stock":true}],"url":"https:\/\/freshlyprintedbooks.co.uk\/products\/interior-point-polynomial-methods-in-convex-programming-paperback-softback-9780898715156","provider":"Freshly Printed Books","version":"1.0","type":"link"}