Algorithms for Convex Optimization
Autor Nisheeth K. Vishnoien Limba Engleză Paperback – 6 oct 2021
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 253.45 lei 43-57 zile | |
Cambridge University Press – 6 oct 2021 | 253.45 lei 43-57 zile | |
Hardback (1) | 526.95 lei 22-36 zile | +26.17 lei 5-11 zile |
Cambridge University Press – 6 oct 2021 | 526.95 lei 22-36 zile | +26.17 lei 5-11 zile |
Preț: 253.45 lei
Preț vechi: 316.82 lei
-20% Nou
Puncte Express: 380
Preț estimativ în valută:
48.50€ • 50.33$ • 40.54£
48.50€ • 50.33$ • 40.54£
Carte tipărită la comandă
Livrare economică 17-31 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781108741774
ISBN-10: 1108741770
Pagini: 200
Dimensiuni: 150 x 228 x 20 mm
Greutate: 0.5 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:New York, United States
ISBN-10: 1108741770
Pagini: 200
Dimensiuni: 150 x 228 x 20 mm
Greutate: 0.5 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:New York, United States
Cuprins
1. Bridging continuous and discrete optimization; 2. Preliminaries; 3. Convexity; 4. Convex optimization and efficiency; 5. Duality and optimality; 6. Gradient descent; 7. Mirror descent and multiplicative weights update; 8. Accelerated gradient descent; 9. Newton's method; 10. An interior point method for linear programming; 11. Variants of the interior point method and self-concordance; 12. Ellipsoid method for linear programming; 13. Ellipsoid method for convex optimization.
Recenzii
'The field of mathematical programming has two major themes: linear programming and convex programming. The far-reaching impact of the first theory in computer science, game theory and engineering is well known. We are now witnessing the growth of the second theory as it finds its way into diverse fields such as machine learning, mathematical economics and quantum computing. This much-awaited book with its unique approach, steeped in the modern theory of algorithms, will go a long way in making this happen.' Vijay V. Vazirani, Distinguished Professor at University of California, Irvine
'I had thought that there is no need for new books about convex optimization but this book proves me wrong. It treats both classic and cutting-edge topics with an unparalleled mix of clarity and rigor, building intuitions about key ideas and algorithms driving the field. A must read for anyone interested in optimization!' Aleksander Madry, Massachusetts Institute of Technology
'Vishnoi's book provides an exceptionally good introduction to convex optimization for students and researchers in computer science, operations research, and discrete optimization. The book gives a comprehensive introduction to classical results as well as to some of the most recent developments. Concepts and ideas are introduced from first principles, conveying helpful intuitions. There is significant emphasis on bridging continuous and discrete optimization, in particular, on recent breakthroughs on flow problems using convex optimization methods; the book starts with an enlightening overview of the interplay between these areas.' László Végh, LSE
'Recommended.' M. Bona, Choice Connect
'I had thought that there is no need for new books about convex optimization but this book proves me wrong. It treats both classic and cutting-edge topics with an unparalleled mix of clarity and rigor, building intuitions about key ideas and algorithms driving the field. A must read for anyone interested in optimization!' Aleksander Madry, Massachusetts Institute of Technology
'Vishnoi's book provides an exceptionally good introduction to convex optimization for students and researchers in computer science, operations research, and discrete optimization. The book gives a comprehensive introduction to classical results as well as to some of the most recent developments. Concepts and ideas are introduced from first principles, conveying helpful intuitions. There is significant emphasis on bridging continuous and discrete optimization, in particular, on recent breakthroughs on flow problems using convex optimization methods; the book starts with an enlightening overview of the interplay between these areas.' László Végh, LSE
'Recommended.' M. Bona, Choice Connect
Notă biografică
Descriere
A concise, accessible guide to the modern optimization methods that are transforming computer science, data science, and machine learning.