Numerical Optimization with Computational Errors

Nonfiction, Science & Nature, Mathematics, Number Systems, Calculus
Cover of the book Numerical Optimization with Computational Errors by Alexander J. Zaslavski, Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Alexander J. Zaslavski ISBN: 9783319309217
Publisher: Springer International Publishing Publication: April 22, 2016
Imprint: Springer Language: English
Author: Alexander J. Zaslavski
ISBN: 9783319309217
Publisher: Springer International Publishing
Publication: April 22, 2016
Imprint: Springer
Language: English

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.

  

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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 books from Springer International Publishing

Cover of the book Design and Management of Energy-Efficient Hybrid Electrical Energy Storage Systems by Alexander J. Zaslavski
Cover of the book Parallel Computing Technologies by Alexander J. Zaslavski
Cover of the book Optimal Operation of Batch Membrane Processes by Alexander J. Zaslavski
Cover of the book The Caloris Network by Alexander J. Zaslavski
Cover of the book Double Enumeration of Legislative Powers in a Sub-State Context by Alexander J. Zaslavski
Cover of the book Reviews of Environmental Contamination and Toxicology Volume 232 by Alexander J. Zaslavski
Cover of the book Religion and the American Presidency by Alexander J. Zaslavski
Cover of the book Environment and Skin by Alexander J. Zaslavski
Cover of the book Pocket Guide to Kidney Stone Prevention by Alexander J. Zaslavski
Cover of the book Heat Pipe Applications in Fission Driven Nuclear Power Plants by Alexander J. Zaslavski
Cover of the book Clinical Approaches to Hospital Medicine by Alexander J. Zaslavski
Cover of the book Suffering and the Intelligence of Love in the Teaching Life by Alexander J. Zaslavski
Cover of the book Sociology in Russia by Alexander J. Zaslavski
Cover of the book Linear and Integer Programming Made Easy by Alexander J. Zaslavski
Cover of the book Multi-Agent Based Simulation XVII by Alexander J. Zaslavski
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy