Introductory Lectures Convex Optimization by Nesterov (18 results)

hardcover. Condition: Very Good.

Hardcover. Condition: Très bon. Ancien livre de bibliothèque avec équipements. Edition 2003. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 2003. Ammareal gives back up to 15% of this item's net price to charity organizations.

Hardcover. Condition: Très bon. Ancien livre de bibliothèque avec équipements. Edition 2004. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 2004. Ammareal gives back up to 15% of this item's net price to charity organizations.

Hardcover. Condition: Brand New. 2nd edition. 589 pages. 9.25x6.25x1.50 inches. In Stock.

Condition: New.

hardcover. Condition: New. In shrink wrap. Looks like an interesting title!

Condition: New. In.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: As New. Unread book in perfect condition.

Hardback. Condition: New. 2004 ed. This is an elementary exposition of the main ideas of complexity theory for convex optimization. The book covers optimal methods and lower complexity bounds for smooth and non-smooth convex optimization. A separate chapter is devoted to polynomial-time interior-point methods.

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 the new developments in the field. Actually, this was a major challenge. 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 had appeared in print only once in the form of research monograph [12].

Hardback. Condition: New. 2004 ed. This is an elementary exposition of the main ideas of complexity theory for convex optimization. The book covers optimal methods and lower complexity bounds for smooth and non-smooth convex optimization. A separate chapter is devoted to polynomial-time interior-point methods.

Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 the new developments in the field. Actually, this was a major challenge. 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 had appeared in print only once in the form of research monograph [12]. 260 pp. Englisch.

Buch. Condition: Neu. Introductory Lectures on Convex Optimization | A Basic Course | Y. Nesterov | Buch | Applied Optimization | xviii | Englisch | 2003 | Springer | EAN 9781402075537 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.

Buch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 the new developments in the field. Actually, this was a major challenge. 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 had appeared in print only once in the form of research monograph [12].Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 260 pp. Englisch.

Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.