| 书目名称 | Introductory Lectures on Convex Optimization | | 副标题 | A Basic Course | | 编辑 | Yurii Nesterov | | 视频video | | | 丛书名称 | Applied Optimization | | 图书封面 |  | | 描述 | 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 surprising feature of this algorithm was that the theoretical pre diction of its high efficiency was supported by excellent computational results. This unusual fact dramatically changed the style and direc tions of the research in nonlinear optimization. Thereafter it became more and more common that the new methods were provided with a complexity analysis, which was considered a better justification of their efficiency than computational experiments. In a new rapidly develop ing field, which got the name "polynomial-time interior-point methods", such a justification was obligatory. Afteralmost fifteen years of intensive research, the main results of this development started to appear in monographs[12, 14, 16, 17, 18, 19]. Approximately at that time the author was asked to prepare a new course on nonlinear optimization for graduate students. The idea was to create a course which would reflect th | | 出版日期 | Book 20041st edition | | 关键词 | complexity; complexity theory; graphs; mathematical programming; optimization | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4419-8853-9 | | isbn_ebook | 978-1-4419-8853-9Series ISSN 1384-6485 | | issn_series | 1384-6485 | | copyright | Springer Science+Business Media New York 2004 |
The information of publication is updating
|
|
发表于 2025-3-21 19:22:18
