This is the first elementary exposition of the main ideas of complexity theory for convex optimization. Up to now, most of the material can be found only in special journals and research monographs. The book covers optimal methods and lower complexity bounds for smooth and non-smooth convex optimization. A separate chapter is devoted to polynomial-time interior-point methods. Audience: The book is suitable for industrial engineers and economists.

Скачать книгу бесплатно (djvu, 2.43 Mb)

---

Читать «Introductory Lectures on Convex Optimization: A Basic Course»