| 紀錄類型: |
書目-電子資源
: Monograph/item
|
| 杜威分類號: |
515.882 |
| 書名/作者: |
Algorithms for convex optimization/ Nisheeth K. Vishnoi. |
| 作者: |
Vishnoi, Nisheeth K. |
| 出版者: |
Cambridge : : Cambridge University Press,, 2021. |
| 面頁冊數: |
xvi, 323 p. : : ill., digital ;; 24 cm. |
| 附註: |
Title from publisher's bibliographic system (viewed on 27 Sep 2021). |
| 標題: |
Mathematical optimization. |
| 標題: |
Convex programming. |
| 標題: |
Convex functions. |
| ISBN: |
9781108699211 |
| ISBN: |
9781108482028 |
| ISBN: |
9781108741774 |
| 摘要、提要註: |
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. |
| 電子資源: |
https://doi.org/10.1017/9781108699211 |