Description: About this Item The item is a book Paperback The Author Name is Nisheeth K. Vishnoi The Title is Algorithms for Convex Optimization Condition New Other Comments Pages Count - 340. Binding type - Perfect. Content Language - English Category - COMPUTERS / Programming / Algorithms MATHEMATICS / Calculus Product 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. We Use Stock Images Because we have over 2 million items for sale we have to use stock images, this listing does not include the actual image of the item for sale. The purchase of this specific item is made with the understanding that the image shown in this listing is a stock image and not the actual item for sale. For example: some of our stock images include stickers, labels, price tags, hyper stickers, obi's, promotional messages, signatures and or writing which may not be available in the actual item. When possible we will add details of the items we are selling to help buyers know what is included in the item for sale. The details  are provided automatically  from our central master database and can sometimes be wrong. Books are released in many editions and variations, such as standard edition, re-issue, not for sale, promotional, special edition, limited edition, and many other editions and versions.  The Book you receive could be any of these editions or variations. If you are looking for a specific edition or version please contact us to verify what we are selling.   Gift IdeasThis is a  great  gift idea.   Hours of ServiceWe have many warehouses,  some of the warehouses process orders seven days a week, but the Administration Support Staff are located at a head office location, outside of the warehouses, and typically work only Monday to Friday. Location ID 555z iHaveit SKU ID 164075476
Price: 47.95 GBP
Location: GB
End Time: 2025-01-18T12:34:28.000Z
Shipping Cost: 22 GBP
Product Images
Item Specifics
Return postage will be paid by: Buyer
Returns Accepted: Returns Accepted
After receiving the item, your buyer should cancel the purchase within: 30 days
Return policy details:
Fiction/Non-Fiction: Non-Fiction
Genre/Subject: COMPUTERS / Programming / Algorithms
Brand: Cambridge University Press
Weight: 0.5
Style: NA
Title: Algorithms for Convex Optimization
Release Title: Algorithms for Convex Optimization
Record Grading: New
Sleeve Grading: New
Platform: NA
Size: NA
Film/TV Title: Algorithms for Convex Optimization
Colour: NA
Material: NA
Department: NA
Binding Type: Perfect
Item Length: 228.6
Item Width: 152.4
Item Height: 19.3
Main Stone: NA
Metal Purity: NA
Metal: NA
Connectivity: NA
Model: NA
Publication Name: Algorithms for Convex Optimization
Format: Paperback
Language: English
Publisher: Cambridge University Press
Subject: Computer Science, Mathematics
Publication Year: 2021
Type: Textbook
Author: Nisheeth K. Vishnoi
Item Weight: 500 g
Number of Pages: 200 Pages