Get Free Shipping on orders over $79
Algorithms for Convex Optimization - Nisheeth K. Vishnoi

Algorithms for Convex Optimization

By: Nisheeth K. Vishnoi

eText | 7 October 2021

At a Glance

eText


$63.95

or 4 interest-free payments of $15.99 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
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.
on
Desktop
Tablet
Mobile

Other Editions and Formats

Hardcover

Published: 7th October 2021

More in Computer Science

Amazon.com : Get Big Fast - Robert Spector

eBOOK

AI-Powered Search - Trey Grainger

eBOOK

Tissue Proteomics : Methods and Protocols - Taufika Islam Williams

eBOOK

RRP $369.00

$332.99

10%
OFF