Approximation and Complexity in Numerical Optimization / Najlacnejšie knihy
Approximation and Complexity in Numerical Optimization

Kód: 01423253

Approximation and Complexity in Numerical Optimization

Autor Panos M. Pardalos

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 ... celý popis

206

Bežne: 223.13 €

Ušetríte 17.13 €


Skladom u dodávateľa
Odosielame za 5 - 8 dní
Pridať medzi želanie

Mohlo by sa vám tiež páčiť

Darujte túto knihu ešte dnes
  1. Objednajte knihu a vyberte Zaslať ako darček.
  2. Obratom obdržíte darovací poukaz na knihu, ktorý môžete ihneď odovzdať obdarovanému.
  3. Knihu zašleme na adresu obdarovaného, o nič sa nestaráte.

Viac informácií

Viac informácií o knihe Approximation and Complexity in Numerical Optimization

Nákupom získate 498 bodov

Anotácia knihy

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.

Parametre knihy

Zaradenie knihy Knihy po anglicky Mathematics & science Mathematics Calculus & mathematical analysis

206

Obľúbené z iného súdka



Osobný odber Bratislava a 12792 dalších

Copyright ©2008-26 najlacnejsie-knihy.sk Všetky práva vyhradenéSúkromieCookies


Môj účet: Prihlásiť sa
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Nákupný košík ( prázdny )

Vyzdvihnutie v Zásielkovni
zadarmo nad 59,99 €.

Nachádzate sa: