Kids Library Home

Welcome to the Kids' Library!

Search for books, movies, music, magazines, and more.

     
Available items only
Print Material
Author Vishnoi, Nisheeth K., 1976- author.

Title Algorithms for convex optimization / Nisheeth K. Vishnoi.

Publication Info. Cambridge, United Kingdom ; New York, NY : Cambridge University Press, 2021.
2021

Copies

Location Call No. OPAC Message Status
 Axe 2nd Floor Stacks  515.882 V823a 2021    ---  Available
1 copy being processed for Axe Acquisitions Order.
Description xvi, 323 pages : illustrations ; 24 cm
text txt rdacontent
unmediated n rdamedia
volume nc rdacarrier
Bibliography Includes bibliographical references and index.
Summary "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"-- Provided by publisher.
Contents Bridging continuous and discrete optimization -- Preliminaries -- Convexity -- Convex optimization and efficiency -- Duality and optimality -- Gradient descent -- Mirror descent and the multiplicative weights update -- Accelerated gradient descent -- Newton's method -- An interior point method for linear programming -- Variants of interior point method and self-concordance -- Ellipsoid method for linear programming -- Ellipsoid method for convex optimization.
Subject Mathematical optimization.
Convex functions.
Convex programming.
Convex functions. (OCoLC)fst00877260
Convex programming. (OCoLC)fst00877263
Mathematical optimization. (OCoLC)fst01012099
ISBN 9781108482028 hardcover
1108482023 hardcover
9781108741774 paperback
1108741770 paperback
9781108699211 electronic publication
9781108757379 electronic book
Standard No. 40030839014

 
    
Available items only