Numerical Optimization with Computational Errors
Alexander J. Zaslavski
Verkauft von AHA-BUCH GmbH, Einbeck, Deutschland
AbeBooks-Verkäufer seit 14. August 2006
Neu - Hardcover
Zustand: Neu
Anzahl: 1 verfügbar
In den Warenkorb legenVerkauft von AHA-BUCH GmbH, Einbeck, Deutschland
AbeBooks-Verkäufer seit 14. August 2006
Zustand: Neu
Anzahl: 1 verfügbar
In den Warenkorb legenDruck auf Anfrage Neuware - Printed after ordering - This book studies the approximate solutions of optimization problems inthe presence of computational errors. A number of results are presented on theconvergence behavior of algorithms in a Hilbert space; these algorithms are examined taking into account computational errors. The author illustrates that algorithms generate a good approximate solution, if computational errors are bounded from above by a small positive constant. Known computational errors are examined with the aim of determining an approximate solution. Researchers and students interested in the optimization theory and its applications will find this book instructive and informative. This monograph contains 16 chapters; including a chapters devoted to the subgradient projection algorithm, the mirror descent algorithm, gradient projection algorithm, the Weiszfelds method, constrained convex minimization problems, the convergence of a proximal point method in a Hilbert space, the continuous subgradient method, penalty methods and Newton's method.
Bestandsnummer des Verkäufers 9783319309200
This book studies the approximate solutions of optimization problems in the presence of computational errors. A number of results are presented on the convergence behavior of algorithms in a Hilbert space; these algorithms are examined taking into account computational errors. The author illustrates that algorithms generate a good approximate solution, if computational errors are bounded from above by a small positive constant. Known computational errors are examined with the aim of determining an approximate solution. Researchers and students interested in the optimization theory and its applications will find this book instructive and informative.
This monograph contains 16 chapters; including a chapters devoted to the subgradient projection algorithm, the mirror descent algorithm, gradient projection algorithm, the Weiszfelds method, constrained convex minimization problems, the convergence of a proximal point method in a Hilbert space, the continuous subgradient method, penalty methods and Newton’s method.
This book studies the approximate solutions of optimization problems in the presence of computational errors. A number of results are presented on the convergence behavior of algorithms in a Hilbert space; these algorithms are examined taking into account computational errors. The author illustrates that algorithms generate a good approximate solution, if computational errors are bounded from above by a small positive constant. Known computational errors are examined with the aim of determining an approximate solution. Researchers and students interested in the optimization theory and its applications will find this book instructive and informative.
This monograph contains 16 chapters; including a chapters devoted to the subgradient projection algorithm, the mirror descent algorithm, gradient projection algorithm, the Weiszfelds method, constrained convex minimization problems, the convergence of a proximal point method in a Hilbert space, the continuous subgradient method, penalty methods and Newton s method.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Allgemeine Geschäftsbedingungen und Kundeninformationen / Datenschutzerklärung
I. Allgemeine Geschäftsbedingungen
§ 1 Grundlegende Bestimmungen
(1) Die nachstehenden Geschäftsbedingungen gelten für alle Verträge, die Sie mit uns als Anbieter (AHA-BUCH GmbH) über die Internetplattformen AbeBooks und/oder ZVAB schließen. Soweit nicht anders vereinbart, wird der Einbeziehung gegebenenfalls von Ihnen verwendeter eigener Bedingungen widersprochen.
(2) Verbraucher im Sinne der nachstehenden Regelungen...
Mehr InformationWir liefern Lagerartikel innerhalb von 24 Stunden nach Erhalt der Bestellung aus.
Barsortimentsartikel, die wir über Nacht geliefert bekommen, am darauffolgenden Werktag.
Unser Ziel ist es Ihnen die Artikel in der ökonomischten und effizientesten Weise zu senden.