Approximation and Complexity in Numerical Optimization

Name: Approximation and Complexity in Numerical Optimization
Brand: Springer
SKU: 9780792362753
Price: 80353 HUF
Availability: InStock

Continuous and Discrete Problems

Szerző: Panos M. Pardalos

Nyelv:

Kötés: Kemény kötésű

Kiadó: Springer

Elérhetőség: Beszállítói készleten alacsony példányszámban

Küldés 13-18 napon belül

80 353 Ft

There has been much recent progress in approximation algorithms for nonconvex continuous and discret...

Információk a könyvről

Szerző

Panos M. Pardalos

Nyelv

Angol

Kötés

Könyv - Kemény kötésű

Kiadva

2000

oldal

581

EAN

9780792362753

ISBN

0792362756

Enbook ID

01396380

Kiadó

Springer

Súly

2250

Méretek

156 x 234 x 37

Teljes leírás

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.

Érdekelheti

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

Approximation and Complexity in Numerical Optimization

Continuous and Discrete Problems

Információk a könyvről

Teljes leírás

Érdekelheti

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták