<p>This book provides a comprehensive, modern introduction to convex optimization, a field that is becoming increasingly important in applied mathematics, economics and finance, engineering, and computer science, notably in data science and machine learning.<p></p><p>Written by a leading expert in t
Lectures on robust convex optimization
β Scribed by Nemirovski A.
- Publisher
- ETH Zurich and University of Zurich
- Year
- 1999
- Tongue
- English
- Leaves
- 320
- Category
- Library
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
<p>It was in the middle of the 1980s, when the seminal paper by KarΒ markar opened a new epoch in nonlinear optimization. The importance of this paper, containing a new polynomial-time algorithm for linear opΒ timization problems, was not only in its complexity bound. At that time, the most surprisi
Nesterov (Center of Operations Research and Econometrics, Universitè Catholique de Louvain, Belgium) explains the main ideas of complexity theory for convex optimization, covering optimal methods and lower complexity bounds for smooth and non-smooth convex optimization. A separate chapter is devoted