This book, developed through class instruction at MIT over the last 15 years, provides an accessible, concise, and intuitive presentation of algorithms for solving convex optimization problems. It relies on rigorous mathematical analysis, but also aims at an intuitive exposition that makes use of vi
Convex optimization algorithms
โ Scribed by Bertsekas D.P.
- Publisher
- Athena Scientific
- Year
- 2015
- Tongue
- English
- Leaves
- 578
- Category
- Library
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This book, developed through class instruction at MIT over the last 15 years, provides an accessible, concise, and intuitive presentation of algorithms for solving convex optimization problems. It relies on rigorous mathematical analysis, but also aims at an intuitive exposition that makes use of vi
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 gra
<p><p></p>This focused monograph presents a study of subgradient algorithms for constrained minimization problems in a Hilbert space. The book is of interest for experts in applications of optimization to engineering and economics. The goal is to obtain a good approximate solution of the problem in
"Provides a comprehensive and accessible exploration of modern topics in convex analysis and optimization algorithms, with an emphasis on bridging the two areas"--