國立高雄大學圖資館 |

Language: English

Back

Algorithms for convex optimization

Record Type:	Electronic resources : Monograph/item
Title/Author:	Algorithms for convex optimizationNisheeth K. Vishnoi.
Author:	Vishnoi, Nisheeth K.
Published:	Cambridge :Cambridge University Press,2021.
Description:	xvi, 323 p. :ill., digital ;24 cm.
Notes:	Title from publisher's bibliographic system (viewed on 27 Sep 2021).
Subject:	Mathematical optimization.
Online resource:	https://doi.org/10.1017/9781108699211
ISBN:	9781108699211$q(electronic bk.)

Algorithms for convex optimization
Vishnoi, Nisheeth K.

Algorithms for convex optimization[electronic resource] /Nisheeth K. Vishnoi. - Cambridge :Cambridge University Press,2021. - xvi, 323 p. :ill., digital ;24 cm.

Title from publisher's bibliographic system (viewed on 27 Sep 2021).

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.

ISBN: 9781108699211$q(electronic bk.)Subjects--Topical Terms:

183292
Mathematical optimization.

LC Class. No.: QA402.5 / .V57 2021

Dewey Class. No.: 515.882

Algorithms for convex optimization
LDR:01749nmm a2200253 a 4500 001 642087
003 UkCbUP
005 20211013113514.0
006 m d
007 cr nn 008maaau
008 231123s2021 enk o 1 0 eng d
020 $a 9781108699211$q(electronic bk.)
020 $a 9781108482028$q(hardback)
020 $a 9781108741774$q(paperback)
035 $a CR9781108699211
040 $a UkCbUP $b eng $c UkCbUP $d GP
050 0 0 $a QA402.5 $b .V57 2021
082 0 0 $a 515.882 $2 23
090 $a QA402.5 $b .V829 2021
100 1 $a Vishnoi, Nisheeth K. $3 949208
245 1 0 $a Algorithms for convex optimization $h [electronic resource] / $c Nisheeth K. Vishnoi.
260 $a Cambridge : $b Cambridge University Press, $c 2021.
300 $a xvi, 323 p. : $b ill., digital ; $c 24 cm.
500 $a Title from publisher's bibliographic system (viewed on 27 Sep 2021).
520 $a 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 0 $a Mathematical optimization. $3 183292
650 0 $a Convex programming. $3 185825
650 0 $a Convex functions. $3 191128
856 4 0 $u https://doi.org/10.1017/9781108699211