DeepRead
Cover of Convex optimization

About the book

Convex optimization covers the theory and practice of minimizing convex functions over convex sets. It introduces convex sets and functions, the standard problem forms, duality, and algorithms, with particular attention to interior-point methods for solving problems at scale. Applications include approximation and fitting, statistical estimation, geometric programming, and engineering design. Many practical problems that look hard can be recast as convex optimization problems, which can be solved reliably and efficiently, both in theory and in practice. The book's central claim is that recognizing convex structure in a problem, and modeling it accordingly, gives tractable solutions with global optimality guarantees. It also argues that duality and convex analysis supply both the certificates of optimality and the algorithms needed to compute them.

Written by Claude from what it knows of this book.

What Hacker News says 70% recommend · 2% critical

0102020092015202020262018 peak · 13
This bookAverage book in Bayesian and probabilistic modeling

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

The threads it came up in

Details

First published
2006
ISBN
9780521833783
Editions known
2 at Open Library
Open Library
OL4472195W

Convex functionsConvex setsFonctions convexesMathematical optimizationOptimisation mathematique

Explore in the mosaic

Read next: its neighbours on the mosaic