Interior Point Polynomial Algorithms in Convex Programming (Studies in Applied and Numerical Mathematics v. 13)

Interior Point Polynomial Algorithms in Convex Programming (Studies in Applied and Numerical Mathematics v. 13)

By: Yurii Nesterov (author), Arkadii Nemirovskii (author)Paperback

1 - 2 weeks availability

Description

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.

Create a review

Contents

1. Self-concordant functions and Newton method; 2. Path-following interior-point methods; 3. Potential Reduction interior-point methods; 4. How to construct self- concordant barriers; 5. Applications in convex optimization; 6.Variational inequalities with monotone operators; 7. Acceleration for linear and linearly constrained quadratic problems; Bibliography; Appendix 1; Appendix 2.

Product Details

  • publication date: 01/01/1987
  • ISBN13: 9780898715156
  • Format: Paperback
  • Number Of Pages: 415
  • ID: 9780898715156
  • weight: 852
  • ISBN10: 0898715156

Delivery Information

  • Saver Delivery: Yes
  • 1st Class Delivery: Yes
  • Courier Delivery: Yes
  • Store Delivery: Yes

Prices are for internet purchases only. Prices and availability in WHSmith Stores may vary significantly

Close