Description: Please refer to the section BELOW (and NOT ABOVE) this line for the product details - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Title:Approximation And Complexity In Numerical Optimization: Continuous And Discrete ProblemsISBN13:9781441948298ISBN10:1441948295Author:Pardalos, Panos M. (Editor)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 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 Binding:Paperback, PaperbackPublisher:SPRINGER NATUREPublication Date:2010-12-02Weight:1.83 lbsDimensions:1.22'' H x 9.21'' L x 6.14'' WNumber of Pages:581Language:English
Price: 224.48 USD
Location: USA
End Time: 2024-12-03T13:29:00.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 30 Days
Refund will be given as: Money Back
Return policy details:
Book Title: Approximation And Complexity In Numerical Optimization: Cont...
Item Length: 9.3in
Item Width: 6.1in
Author: Panos M. Pardalos
Publication Name: Approximation and Complexity in Numerical Optimization : Continuous and Discrete Problems
Format: Trade Paperback
Language: English
Publisher: Springer
Series: Nonconvex Optimization and Its Applications Ser.
Publication Year: 2010
Type: Textbook
Item Weight: 32 Oz
Number of Pages: Xiv, 581 Pages
