You might also like

Availability alert

More about Interior Point Polynomial Methods in Convex Programming

• Book details
• Synopsis
• Trending among others

You get 366 loyalty points

Book synopsis

Written 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.

Book details

Book category Knihy po anglicky Mathematics & science Mathematics Optimization

• Full title: Interior Point Polynomial Methods in Convex Programming
• Author: Yurii NesterovArkadii Nemirovskii
• Language: English
• Binding: Paperback
• Number of pages: 414
• EAN: 9780898715156
• ISBN: 0898715156
• ID: 02050131
• Publisher: Society for Industrial & Applied Mathematics,U.S.
• Weight: 852 g
• Dimensions: 256 × 177 × 26 mm
• Date of publishing: 30. June 2006

Trending among others

---

---

---