Introductory Lectures on Convex Optimization: A Basic Course

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Y. Nesterov
Series: Applied Optimization
Edition: 1
Publisher: Springer
Year: 2003

Language: English
Pages: 253