20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Algorithms for Convex Optimization - Nisheeth K. Vishnoi

English
2021-10-07
€78.76 €98.45

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

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 ... Full description

You May Also Like

Description

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.

More Information

Author Nisheeth K. Vishnoi
Publisher Cambridge University Press
Release year 2021
Cover type Softcover
EAN 9781108741774
Write Your Own Review
You're reviewing: Algorithms for Convex Optimization
Your Rating:

Goodreads Reviews

€78.76 €98.45