Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 1108741770 ISBN 13: 9781108741774
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 50,69
Anzahl: 1 verfügbar
In den WarenkorbZustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 1108741770 ISBN 13: 9781108741774
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 49,58
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 1108741770 ISBN 13: 9781108741774
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 1108741770 ISBN 13: 9781108741774
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.