DeepRead
Cover of Introductory Lectures on Convex Optimization

Introductory Lectures on Convex Optimization

Y. Nesterov · 2003

Mathematics and physics › Numerical and matrix computation

#12,844 most recommended

About the book

A systematic introduction to convex optimization that treats the subject through complexity theory: how many iterations different methods need, and how the problem class limits what any method can achieve. It covers optimal methods and lower complexity bounds for both smooth and non-smooth convex problems, with a separate chapter on polynomial-time interior-point methods. The description says it was written for industrial engineers and economists as well as mathematicians. The central claim is that convex problems can be judged by worst-case iteration counts, and that lower bounds show no method can beat certain rates for a given class of problems. It argues that the classical gradient method is not optimal for smooth convex problems, and that an accelerated scheme reaches the best possible rate. For non-smooth problems it presents a smoothing technique that exploits the structure of the objective, and it argues that self-concordant barrier functions yield interior-point methods with polynomial-time guarantees.

Written by Claude from what it knows of this book.

What Hacker News says 50% recommend · 0% critical

00.5120212022202420262021 peak · 1
This bookAverage book in Numerical and matrix computation

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 1 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
2003
ISBN
9781441988539
Editions known
4 at Open Library
Open Library
OL8701485W

Information theoryMathematical optimizationMathematicsOptimizationTheory of Computation

Explore in the mosaic

Read next: its neighbours on the mosaic