Algorithms for convex optimization / Nisheeth K. Vishnoi.
"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...
Saved in:
| Online Access: |
Full Text (via Cambridge) |
|---|---|
| Main Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
New York :
Cambridge University Press,
[2021]
|
| Subjects: |