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.

Author: Akizilkree Yogor
Country: Bosnia & Herzegovina
Language: English (Spanish)
Genre: Environment
Published (Last): 6 February 2005
Pages: 86
PDF File Size: 10.93 Mb
ePub File Size: 20.31 Mb
ISBN: 399-9-69064-201-4
Downloads: 66270
Price: Free* [*Free Regsitration Required]
Uploader: Dailmaran

Introductory Lectures on Convex Optimization: A Basic Course – Yurii Nesterov – Google Books

A Basic Course Y. Afteralmost fifteen years of intensive research, the main results of this development started to appear in monographs [12, 14, 16, 17, 18, optijization. The general theory of self-concordant functions had appeared in print only once in the form of research monograph [12].

Nesterov Limited preview – This unusual fact dramatically changed the style and direc tions of the research in nonlinear optimization. The idea was to create a course which would reflect the new developments in the field.


Introductory lectures on convex optimization : a basic course in SearchWorks catalog

Luenberger newterov, Yinyu Ye Limited preview – It was in the middle of the s, when the seminal paper by Kar markar opened a new epoch in nonlinear optimization.

In a new rapidly develop ing field, which got the name “polynomial-time interior-point methods”, such a justification was obligatory.

Contents Nonlinear Optimization 11 World of nonlinear optimization General formulation of the problem. Account Options Sign in.

SearchWorks Catalog

Linear and Nonlinear Programming David G. Actually, this was a major challenge.

Structural Optimization 41 Selfconcordant functions Black box concept in convex 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. Numerische Verfahren der konvexen, nichtglatten Optimierung: Conves Convex Optimization 21 Minimization of smooth functions Smooth convex functions.

At that time, the most surprising feature At the time only the theory of interior-point methods for linear optimization was polished enough to be explained to students. My library Help Advanced Book Search. Introductory Lectures on Convex Conevx Approximately at that time the author was asked to prepare a new course on nonlinear optimization for graduate students.


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. Nonsmooth Convex Optimization 31 General netserov functions Motivation and definitions. Walter Alt Limited preview – References to this book Numerische Verfahren der konvexen, nichtglatten Optimierung: The importance of this paper, containing a new polynomial-time algorithm for linear op timization problems, was not only in its complexity bound.

Nonlinear Optimization 11 World of introdductory optimization General formulation of the problem.