Search Type
  • All
  • Subject
  • Title
  • Author
  • Publisher
  • Series Title
Search Title

Download

Interior Point Polynomial Methods in Convex Programming

Interior Point Polynomial Methods in Convex Programming( )
Author: Nesterov, Yurii
Nemirovskii, Arkadii
Series title:Studies in Applied and Numerical Mathematics Ser.
ISBN:978-0-89871-515-6
Publication Date:Jun 2006
Publisher:Society for Industrial and Applied Mathematics
Book Format:Paperback
List Price:AUD $195.00
Book Description:

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 analysed. This approach yields polynomial-time interior-point methods for a wide variety of problems beyond the traditional linear and quadratic programs.

Book Details
Pages:414
Detailed Subjects: Mathematics / Optimization
Physical Dimensions (W X L X H):15.2 x 22.8 x 2.5 cm
Book Weight:0.855 Kilograms



Rate this title:

Select your rating below then click 'submit'.






I do not wish to rate this title.