Your Waterstones card is changing, introducing...
TELL ME MORE
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems - Nonconvex Optimization and Its Applications 42 (Hardback)
  • Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems - Nonconvex Optimization and Its Applications 42 (Hardback)
zoom

Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems - Nonconvex Optimization and Its Applications 42 (Hardback)

(editor)
£249.99
Hardback 581 Pages / Published: 31/05/2000
  • We can order this

Usually despatched within 3 weeks

  • This item has been added to your basket
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 randomization techniques. On the other hand, computational complexity, originating from the interactions between computer science and numeri- cal optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty. The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable. The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions. A conference on Approximation and Complexity in Numerical Optimization: Con- tinuous and Discrete Problems was held during February 28 to March 2, 1999 at the Center for Applied Optimization of the University of Florida.

Publisher: Springer
ISBN: 9780792362753
Number of pages: 581
Weight: 2250 g
Dimensions: 234 x 156 x 33 mm
Edition: 2000 ed.

You may also be interested in...

Normal Accidents
Added to basket
£30.00
Paperback
HACCP
Added to basket
£79.99
Hardback
Practical Reliability Engineering
Added to basket
The Basics of FMEA, 2nd Edition
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.