Algorithms for Convex Optimization by Vishnoi, Nisheeth K. [Hardback]

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.

Price: 127 AUD

Location: Hillsdale, NSW

End Time: 2025-01-17T03:28:33.000Z

Shipping Cost: 31.11 AUD

Product Images

Item Specifics

Return shipping will be paid by: Buyer

Returns Accepted: Returns Accepted

Item must be returned within: 60 Days

Return policy details:

EAN: 9781108482028

UPC: 9781108482028

ISBN: 9781108482028

MPN: N/A

Book Title: Algorithms for Convex Optimization by Vishnoi, Nis

Item Height: 2.2 cm

Item Length: 22.9 cm

Item Width: 15.2 cm

Publisher: Cambridge University Press

Publication Year: 2021

Subject: Computer Science, Mathematics

Number of Pages: 200 Pages

Language: English

Publication Name: Algorithms for Convex Optimization

Item Weight: 669 g

Type: Textbook

Author: Nisheeth K. Vishnoi

Format: Hardcover