Interior-Point Polynomial Algorithms in Convex Programming

Interior-Point Polynomial Algorithms in Convex Programming - SIAM Studies in Applied Mathematics

Book (31 Dec 1994)

Not available for sale

Includes delivery to the United States

Out of stock

This service is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Publisher's 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 for linear and quadratic programming, polynomial time methods for nonlinear convex programming, efficient computation methods for co

Book information

ISBN: 9780898713190
Publisher: Society for Industrial and Applied Mathematics
Imprint: Society for Industrial and Applied Mathematics
Pub date:
DEWEY: 519.76
DEWEY edition: 20
Language: English
Number of pages: 405
Weight: 853g
Height: 255mm
Width: 176mm
Spine width: 26mm