.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Approximation and Complexity in Numerical Optimization
Panos M. . Ed(S): Pardalos
€ 261.33
FREE Delivery in Ireland
Description for Approximation and Complexity in Numerical Optimization
Hardback. Computational complexity, originating from the interactions between computer science and numerical optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty. This book deals with the themes of approximation and complexity. Editor(s): Pardalos, Panos M. Series: Nonconvex Optimization and Its Applications. Num Pages: 595 pages, biography. BIC Classification: PBU; TGP. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 33. Weight in Grams: 1017.
There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continuous universe through geomet ric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new ap proximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization prob lems, new approximate algorithms have been developed based on semidefinite pro gramming and new ... Read more
There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continuous universe through geomet ric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new ap proximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization prob lems, new approximate algorithms have been developed based on semidefinite pro gramming and new ... Read more
Product Details
Format
Hardback
Publication date
2000
Publisher
Kluwer Academic Publishers United States
Number of pages
595
Condition
New
Series
Nonconvex Optimization and Its Applications
Number of Pages
581
Place of Publication
Dordrecht, Netherlands
ISBN
9780792362753
SKU
V9780792362753
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Approximation and Complexity in Numerical Optimization