Don't forget to bookmark this web site !!
Used & Out of Print Books | Contact us | Home

Browse and Compare Price at 40+ Sites and 20,000+ Stores!!

|  FAQ/About us |  Recommend us |  Browse |  Memo |  Book Reviews |  Random Quotes |  Help |


Find more info., search and price compare for
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (Nonconvex Optimization and Its Applications)
Binding: Hardcover, 1 edition, 594 pages
Publisher: Springer
Weight: 2.33 pound
Dimension: H: 0.75 x L: 9.16 x W: 0.5 inches
ISBN 10: 0792362756
ISBN 13: 9780792362753
Click here to search for this book and compare price at 40+ bookstores with!

If you cannot find this book in our new and in print search, be sure to try our used and out of print search too!


Book Description:
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 geometric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new approximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization problems, new approximate algorithms have been developed based on semidefinite programming and new randomization techniques. On the other hand, 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. 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. The two themes of approximation and complexity pervade this book. Audience: Faculty, graduate students, and researchers in mathematical programming, computer sciences and engineering.

|  Home |  FAQ/About us |  Link to us |  Recommend us |  Contact us |  Bookstores |  Memo |

Shipping Destination:
(US only)
Display in:
Search by:

Searching for Out of Print Books? [Click Here]

[ For web hosting, AddALL recommend Liquidweb]