Algorithms for Convex Optimization Vishnoi Hardback Cambridge University Press
From
£66.68
To
£82.79
Algorithms for Convex Optimization\nby Nisheeth K. Vishnoi\nHardback\nEnglish\n\nDelivery\nUsually delivered in 2\u20133 working days (dispatched today if ordered before 3pm).\n\nBrand new copy from BookCurl \u2013 the UK independent online bookseller.\n\n------------------------------\nBook details\n------------------------------\nAuthor: Nisheeth K. Vishnoi\nTitle: Algorithms for Convex Optimization\nFormat: Hardback\nLanguage: English\nTopic: Algorithms and data structures\nPublisher: Cambridge University Press\nISBN-13: 9781108482028\nISBN-10: 1108482023\nRRP: \u00A379.99\n\n------------------------------\nDescription\n------------------------------\nIn 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, inte.
Algorithms for Convex Optimization Vishnoi Hardback Cambridge University Press
Algorithms for Convex Optimization\nby Nisheeth K. Vishnoi\nHardback\nEnglish\n\nDelivery\nUsually delivered in 2\u20133 working days (dispatched today if ordered before 3pm).\n\nBrand new copy from BookCurl \u2013 the UK independent online bookseller.\n\n------------------------------\nBook details\n------------------------------\nAuthor: Nisheeth K. Vishnoi\nTitle: Algorithms for Convex Optimization\nFormat: Hardback\nLanguage: English\nTopic: Algorithms and data structures\nPublisher: Cambridge University Press\nISBN-13: 9781108482028\nISBN-10: 1108482023\nRRP: \u00A379.99\n\n------------------------------\nDescription\n------------------------------\nIn 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, inte.
Price now:
From
£66.68
To