Numerical Optimization with Computational Errors - Alexander J. Zaslavski
-20% with code BOOKS
Shipping in 17-23 days
30-day return policy
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 sma ... Full description
You May Also Like
TOP
Six Not-so-easy Pieces: Einstein's Relativity, Symmetry, and Space-Time
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-20% with code BOOKS
In stock at our supplier
TOP
Six Easy Pieces: Essentials of Physics Explained by Its Most Brilliant Teacher
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-20% with code BOOKS
In stock at our supplier
TOP
Astrophysics for People in a Hurry: Essays on the Universe and Our Place Within It
-20% with code BOOKS
In stock at our supplier
TOP
Behave: The Biology of Humans at Our Best and Worst
-20% with code BOOKS
In stock at our supplier
TOP
The Rise and Fall of the Dinosaurs: A New History of a Lost World
-20% with code BOOKS
In stock at our supplier
TOP
The Rise and Reign of the Mammals: A New History, from the Shadow of the Dinosaurs to Us
-20% with code BOOKS
In stock at our supplier
TOP
Determined: The Science of Life Without Free Will
-20% with code BOOKS
In stock at our supplier
TOP
Beyond Inheritance: Our Ever-Mutating Cells and a New Understanding of Health
-20% with code BOOKS
In stock at our supplier
TOP
The Age of Alchemy: How Early Innovators Shaped Modern Chemistry
-20% with code BOOKS
In stock at our supplier
TOP
The Secrets of our DNA: How Genetics has Changed the World
-20% with code BOOKS
In stock at our supplier
TOP
Introduction to Quantum Mechanics
Darrell F. Schroeter, David J. Griffiths
-20% with code BOOKS
In stock at our supplier
TOP
Why We Sleep: Unlocking the Power of Sleep and Dreams
-20% with code BOOKS
In stock
TOP
Why Machines Learn: The Elegant Maths Behind Modern AI
-20% with code BOOKS
In stock at our supplier
TOP
A Short History of Nearly Everything 2.0
-20% with code BOOKS
In stock at our supplier
TOP
A Brief History of Time: From the Big Bang to Black Holes
-20% with code BOOKS
In stock at our supplier
TOP
Thing Explainer: Complicated Stuff in Simple Words
-20% with code BOOKS
In stock at our supplier
TOP
Biology: A Global Approach, Global Edition
Neil Campbell, Rebecca Orr, Lisa Urry, Peter Minorsky, Michael Cain, Jane Reece, Steven Wasserman
-20% with code BOOKS
In stock at our supplier
Description
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.
More Information
| Author | Alexander J. Zaslavski |
|---|---|
| Publisher | Springer Nature Switzerland |
| Release year | 2016 |
| Cover type | Hardcover |
| EAN | 9783319309200 |