UID:
edocfu_9959327328302883
Format:
1 online resource (xvi, 418 pages) :
,
illustrations
ISBN:
9781118032701
,
1118032705
,
9781118030950
,
1118030958
Content:
The explosive growth of research into and development of interior point algorithms over the past two decades has significantly improved the complexity of linear programming and yielded some of today's most sophisticated computing techniques. This book offers a comprehensive and thorough treatment of the theory, analysis, and implementation of this powerful computational tool. Interior Point Algorithms provides detailed coverage of all basic and advanced aspects of the subject. Beginning with an overview of fundamental mathematical procedures, Professor Yinyu Ye moves swiftly on to in-depth explorations of numerous computational problems and the algorithms that have been developed to solve them.
Note:
Front Matter -- Introduction and Preliminaries -- 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 -- Wiley-Interscience Series in Discrete Mathematics and Optimization.
Additional Edition:
Print version: Ye, Yinyu. Interior point algorithms. New York : Wiley, ©1997 ISBN 9781118030950
Language:
English
Subjects:
Computer Science
,
Mathematics
Keywords:
Electronic books.
URL:
https://onlinelibrary.wiley.com/doi/book/10.1002/9781118032701
