0
Your cart

Your cart is empty

Books > Professional & Technical > Mechanical engineering & materials > Production engineering

Buy Now

Approximation and Complexity in Numerical Optimization - Continuous and Discrete Problems (Hardcover, 2000 ed.) Loot Price: R5,781
Discovery Miles 57 810
Approximation and Complexity in Numerical Optimization - Continuous and Discrete Problems (Hardcover, 2000 ed.): Panos M....

Approximation and Complexity in Numerical Optimization - Continuous and Discrete Problems (Hardcover, 2000 ed.)

Panos M. Pardalos

Series: Nonconvex Optimization and Its Applications, 42

 (sign in to rate)
Loot Price R5,781 Discovery Miles 57 810 | Repayment Terms: R542 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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."

General

Imprint: Springer
Country of origin: Netherlands
Series: Nonconvex Optimization and Its Applications, 42
Release date: May 2000
First published: 2000
Editors: Panos M. Pardalos
Dimensions: 234 x 156 x 33mm (L x W x T)
Format: Hardcover
Pages: 581
Edition: 2000 ed.
ISBN-13: 978-0-7923-6275-3
Categories: Books > Science & Mathematics > Mathematics > Optimization > General
Books > Professional & Technical > Mechanical engineering & materials > Production engineering > General
LSN: 0-7923-6275-6
Barcode: 9780792362753

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners