Verwandte Artikel zu Introductory Lectures on Convex Optimization: A Basic...
Inhaltsangabe
Book by Nesterov Yurii
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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].
Reseña del editor
This is the first elementary exposition of the main ideas of complexity theory for convex optimization. Up to now, most of the material can be found only in special journals and research monographs. 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.
Audience: The book is suitable for industrial engineers and economists.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagSpringer
- Erscheinungsdatum2003
- ISBN 10 1402075537
- ISBN 13 9781402075537
- EinbandTapa dura
- SpracheEnglisch
- Anzahl der Seiten260
Neu kaufen
Diesen Artikel anzeigen
EUR 181,18
EUR 6,15 für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für Introductory Lectures on Convex Optimization: A Basic...
Beispielbild für diese ISBN
Introductory Lectures on Convex Optimization: A Basic Course (Applied Optimization, 87)
Anbieter: BennettBooksLtd, North Las Vegas, NV, USA
Verkäuferbewertung 5 von 5 Sternen
hardcover. Zustand: New. In shrink wrap. Looks like an interesting title! Bestandsnummer des Verkäufers Q-1402075537
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Introductory Lectures on Convex Optimization: A Basic Course (Applied Optimization, 87)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9781402075537_new
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Introductory Lectures on Convex Optimization
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 4095159
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Introductory Lectures on Convex Optimization
Print-on-DemandAnbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: 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. Bestandsnummer des Verkäufers 9781402075537
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Introductory Lectures on Convex Optimization: A Basic Course (Applied Optimization, 87)
Anbieter: California Books, Miami, FL, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers I-9781402075537
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Introductory Lectures on Convex Optimization : A Basic Course
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: 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]. Bestandsnummer des Verkäufers 9781402075537
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Introductory Lectures on Convex Optimization: A Basic Course
Verlag:
Springer-Verlag New York Inc., 2003
ISBN 10: 1402075537
ISBN 13: 9781402075537
Neu
Hardcover
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 572. Bestandsnummer des Verkäufers C9781402075537
Anzahl: Mehr als 20 verfügbar