More From This Series
Discrete Mathematics
  Interior Point Algorithms: Theory and Analysis
ISBN: 978-0-471-17420-2
Hardcover
440 pages
August 1997
US $184.00
 Add to Cart
This price is valid for United States. Change location to view local pricing and availability. This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 5-6 days delivery time. The book is not returnable.
Other Available Formats: E-Book
|
An online version of this product is available through our subscription-based content service. Visit Wiley Online Library now |
Geometry of Convex Inequalities.
Computation of Analytic Center.
Linear Programming Algorithms.
Worst-Case Analysis.
Average-Case Analysis.
Asymptotic Analysis.
Convex Optimization.
Nonconvex Optimization.
Implementation Issues.
Bibliography.
Index.
Computation of Analytic Center.
Linear Programming Algorithms.
Worst-Case Analysis.
Average-Case Analysis.
Asymptotic Analysis.
Convex Optimization.
Nonconvex Optimization.
Implementation Issues.
Bibliography.
Index.
Share This
