Algorithms for convex optimization / (Record no. 93458)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 01433nam a22001817a 4500 |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20250519151822.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 250430b2021 |||||||| |||| 00| 0 eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
International Standard Book Number | 9781108741774 |
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
Classification number | 515.882 VIS-N |
100 ## - MAIN ENTRY--PERSONAL NAME | |
Personal name | Vishnoi, Nisheeth K. |
245 ## - TITLE STATEMENT | |
Title | Algorithms for convex optimization / |
Statement of responsibility, etc. | Nisheeth K. Vishnnoi |
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
Place of publication, distribution, etc. | India |
Name of publisher, distributor, etc. | Cambridge University Press |
Date of publication, distribution, etc. | 2021 |
300 ## - PHYSICAL DESCRIPTION | |
Extent | 323p. |
500 ## - GENERAL NOTE | |
General note | 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 |
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Convex functions |
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Convex Programming |
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Mathematical optimization |
952 ## - LOCATION AND ITEM INFORMATION (KOHA) | |
Withdrawn status |
Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection code | Home library | Current library | Shelving location | Date acquired | Total Checkouts | Full call number | Barcode | Date last seen | Price effective from | Koha item type | Public note |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Dewey Decimal Classification | 510 | BITS Pilani Hyderabad | BITS Pilani Hyderabad | New Book Display (Welcome to Reserve) | 31/03/2025 | 515.882 VIS-N | 49901 | 30/04/2025 | 30/04/2025 | New books on display | Display - 2 |