Contact
How to shop
Delivery
Shopping guide
Algorithms for Convex Optimization
English
118 b
Customers also purchased
/
Paperback
8.49
€
In the last few years, Algorithms for Convex Optimization have revolutionized algorithm design, both for discrete and continuous optimization problems. For problems like maximum flow, maximum matching, and submodular function minimization, the fastest algorithms involve essential methods such as gradient descent, mirror descent, interior point methods, and ellipsoid methods. The goal of this self-contained book is to enable researchers and professionals in computer science, data science, and machine learning to gain an in-depth understanding of these algorithms. The text emphasizes how to derive key algorithms for convex optimization from first principles and how to establish precise running time bounds. This modern text explains the success of these algorithms in problems of discrete optimization, as well as how these methods have significantly pushed the state of the art of convex optimization itself.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Hardback
87.83
€
/
Paperback
13.55
€
/
Paperback
13.35
€
/
Paperback
10.62
€
/
Paperback
24.68
€
/
Hardback
215.54
€
/
Paperback
7.68
€
Hi! I'm Libroamiko, your book advisor.
How can I help you?