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):||11 September 2013|
|PDF File Size:||2.82 Mb|
|ePub File Size:||12.49 Mb|
|Price:||Free* [*Free Regsitration Required]|
In a new rapidly develop ing field, which got the name “polynomial-time interior-point methods”, such a justification was obligatory.
Walter Alt Limited preview – It was in the middle of the s, when the seminal paper by Kar markar opened a new epoch in nonlinear optimization. Contents Nonlinear Optimization 11 World of nonlinear optimization General formulation of the problem. Numerische Verfahren der konvexen, nichtglatten Optimierung: 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.
Linear and Nonlinear Programming David G. Nonlinear Optimization 11 World of nonlinear optimization General formulation of the problem.
References to this book Numerische Verfahren der konvexen, nichtglatten Optimierung: This kectures fact dramatically changed the style and direc tions of the research in nonlinear optimization.
Smooth Convex Optimization 21 Minimization of smooth functions Smooth convex functions. LuenbergerYinyu Ye Limited preview – Nonsmooth Convex Optimization 31 General convex functions Motivation and definitions. My library Help Advanced Book Search.
Introductory lectures on convex optimization : a basic course in SearchWorks catalog
Introductory Lectures on Convex Optimization: At that time, the most surprising feature The idea was to create a course which would reflect the new developments in the field. At the time only the theory of interior-point methods for linear optimization was polished enough to be explained to students.
Account Options Sign in. Approximately at that time the author was asked to prepare a new course on nonlinear optimization for graduate students.
Introductory lectures on convex optimization : a basic course / by Yurii Nesterov – Details – Trove
The importance of this paper, containing a new polynomial-time algorithm for linear op timization problems, was not only in its complexity bound. A Basic Course Y.
Actually, this was a major challenge. 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.
Nesterov Limited preview – Afteralmost fifteen years of intensive research, the main results of this development started to appear in monographs [12, 14, 16, 17, 18, 19].
Structural Optimization 41 Selfconcordant functions Black box concept in convex optimization. The general theory of self-concordant functions had appeared in print only once in the introducttory of research monograph .