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 opti
β¦ LIBER β¦
Introductory Lectures on Convex Optimization: A Basic Course
β Scribed by Y. Nesterov
- Book ID
- 127446540
- Publisher
- Springer
- Year
- 2003
- Tongue
- English
- Weight
- 5 MB
- Series
- Applied Optimization
- Edition
- 1
- Category
- Library
- ISBN
- 1402075537
No coin nor oath required. For personal study only.
β¦ Synopsis
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 to polynomial-time interior-point methods. An undergraduate background in analysis and linear algebra is assumed. The book can be used for a one-semester course, and will be useful for industrial engineers and economists.
π SIMILAR VOLUMES
Introductory Lectures on Convex Optimiza
β
Y. Nesterov
π
Library
π
2003
π
Springer
π
English
β 2 MB
A LECTURE, INTRODUCTORY TO A COURSE ON A
π
Article
π
1829
π
The Lancet
π
English
β 523 KB
A LECTURE INTRODUCTORY TO A COURSE ON SU
π
Article
π
1829
π
The Lancet
π
English
β 794 KB
INTRODUCTORY LECTURE TO A COURSE ON ANAT
β
JACOB, A
π
Article
π
1831
π
The Lancet
π
English
β 559 KB
A Lecture INTRODUCTORY TO A COURSE ON CL
π
Article
π
1872
π
The Lancet
π
English
β 186 KB
Lecture INTRODUCTORY TO THE COURSE ON SU
π
Article
π
1880
π
The Lancet
π
English
β 652 KB