Numerical Optimization with Computational Errors
Alexander J. Zaslavski
Sold by preigu, Osnabrück, Germany
AbeBooks Seller since August 5, 2024
New - Hardcover
Condition: New
Quantity: 5 available
Add to basketSold by preigu, Osnabrück, Germany
AbeBooks Seller since August 5, 2024
Condition: New
Quantity: 5 available
Add to basketNumerical Optimization with Computational Errors | Alexander J. Zaslavski | Buch | ix | Englisch | 2016 | Springer International Publishing | EAN 9783319309200 | 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.
Seller Inventory # 103980944
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.
"About this title" may belong to another edition of this title.
Standard Business Terms and customer information / data protection declaration / battery disposal
I. Standard business terms
§ 1 Basic provisions
(1) The following terms and conditions of business apply for all contracts concluded with us as the supplier (preigu GmbH & Co. KG) via the websites AbeBooks and/or ZVAB. Unless otherwise agreed, the inclusion of your own terms and conditions is explicitly rejected.
(2) A ?consumer' in the sense of the following regulations is every natural person who ...
| Order quantity | 60 to 60 business days | 60 to 60 business days |
|---|---|---|
| First item | US$ 81.34 | US$ 81.34 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.