Jump to ratings and reviews
Rate this book

Convex Optimization Theory

Rate this book
Convex Optimization Theory-Universities Press-Dimitri P Bertsekas-2010-EDN-1

420 pages, Unknown Binding

First published June 30, 2009

3 people are currently reading
59 people want to read

About the author

Dimitri P. Bertsekas

29 books19 followers

Ratings & Reviews

What do you think?
Rate this book

Friends & Following

Create a free account to discover what your friends think of this book!

Community Reviews

5 stars
7 (58%)
4 stars
4 (33%)
3 stars
0 (0%)
2 stars
0 (0%)
1 star
1 (8%)
Displaying 1 of 1 review
1 review
October 20, 2024
This book covers basic grounds of convex analysis (on R^n), similar to the classic Rockafeller's style, with a focus on duality theory.
It starts with the basic properties and definitions for convex sets, functions (taking possibly values on the extended real line), and moves on to establishing a unifying geometric framework (the max-crossing min-common (MC/MC) framework) for various optimization duality results (such as duality for linear/convex optimization problems (including slater's conditions, complementary slackness), properties of subgradients, as well minimax problems).
The book is rich with illustrative, graphical examples and counterexamples, proofs are often written with substantial details, though at parts it could be simplified. The use of the MC/MC framework (which is possibly a unique feature of this book) and epigraph correspondence is also a special feature of this book, giving a unified geometric interpretation of the various duality results that one might encounter in the convex optimization world.
Displaying 1 of 1 review

Can't find what you're looking for?

Get help and learn more about the design.