Yurii Nesterov, Vladimir Shikhman, Distributed Price Adjustment Based on Convex Analysis, Journal of Optimization Theory and Applications, v n Download Citation on ResearchGate | On Jan 1, , Y. Nesterov and others published Introductory Lectures on Convex Optimization: A Basic Course }. Lower bounds for Global Optimization; Rules of the Game.) LECTURE 1. .. Nesterov Introductory Lectures On Convex Optimization: A Basic Course.
|Published (Last):||25 June 2009|
|PDF File Size:||13.76 Mb|
|ePub File Size:||20.51 Mb|
|Price:||Free* [*Free Regsitration Required]|
Account Options Sign in. 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 My library Help Advanced Book Search. Introductory Lectures on Convex Optimization: It was in the middle of the s, when the seminal paper by Kar markar opened a new epoch in nonlinear optimization.
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 optimozation 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 the new developments in the field. Actually, this was a major challenge.
Introductory lectures on convex optimization : a basic course in SearchWorks catalog
At the time only the theory of interior-point methods for linear optimization was polished enough to be explained to students. The general theory of self-concordant functions nestdrov appeared in print only once in the form of research monograph . Contents Nonlinear Optimization 11 World of nonlinear optimization General formulation of the problem.
Smooth Convex Optimization 21 Minimization of smooth functions Smooth convex functions. Nonsmooth Convex Optimization 31 General convex functions Motivation and definitions. Structural Optimization 41 Selfconcordant functions Introdictory box concept in convex optimization.
A Basic Course Y. Nesterov Limited preview – References to this book Numerische Verfahren der konvexen, nichtglatten Optimierung: Walter Alt Limited preview – lectuures Linear and Nonlinear Programming David G.
LuenbergerYinyu Ye Limited preview – Nonlinear Optimization 11 World of nonlinear optimization General formulation of the problem. Numerische Verfahren der konvexen, nichtglatten Optimierung: