Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity (Mathematics and Its Applications). This item is unavailable.
Language: English
Published by Springer (edition 1994), 1994
- Hardcover
- New
Seller: BooksRun, Philadelphia, PA, U.S.A.BooksRun
5-star seller
AbeBooks seller since February 2, 2016
Unavailable
Hardcover
Condition: New
£ 51.98
Item description from seller
The item is brand new, never used or read. It's in perfect condition and may include supplements and/or access codes or come shrink-wrapped.
Seller Inventory # 0792327349-10-1
- Title
- Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity (Mathematics and Its Applications)
- Author
- den Hertog, D.
- Publisher
- Springer (edition 1994)
- Publication year
- 1994
- Condition
- New
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 0792327349
- ISBN 13
- 9780792327349
- Edition
- 1994.
This book describes the rapidly developing field of interior point methods (IPMs). An extensive analysis is given of path-following methods for linear programming, quadratic programming and convex programming. These methods, which form a subclass of interior point methods, follow the central path, which is an analytic curve defined by the problem. Relatively simple and elegant proofs for polynomiality are given. The theory is illustrated using several explicit examples. Moreover, an overview of other classes of IPMs is given. It is shown that all these methods rely on the same notion as the path-following methods: all these methods use the central path implicitly or explicitly as a reference path to go to the optimum.
For specialists in IPMs as well as those seeking an introduction to IPMs. The book is accessible to any mathematician with basic mathematical programming knowledge.
For specialists in IPMs as well as those seeking an introduction to IPMs. The book is accessible to any mathematician with basic mathematical programming knowledge.
"Synopsis" may belong to another edition of this title.
Product Description
Interior Point Approach to Linear, Quadratic and Convex Programming This text describes the rapidly developing field of interior point methods (IPMs). An extensive analysis is given of path-following methods for linear programming, quadratic programming and convex programming.
"About the title" may belong to another edition of this title.
Search results for Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity (Mathematics and Its Applications)
There are 8 more copies of this bookView all results