Numerical Optimization with Computational Errors

Alexander J. Zaslavski

ISBN 10: 331930920X / ISBN 13: 9783319309200

Published by Springer International Publishing Mai 2016, 2016

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 316 pp. Englisch.

Seller Inventory # 9783319309200

Bibliographic Details

• Title: Numerical Optimization with Computational Errors
• Publisher: Springer International Publishing Mai 2016
• Publication Date: 2016
• Language: English
• ISBN 10: 331930920X
• ISBN 13: 9783319309200
• Binding: Buch
• Condition: Neu
• Dimensions: 241W x 160H x 23D millimeters 241 millimeters width by 160 millimeters height by 23 millimeters depth
• Weight: 641 grams

About this title

Synopsis

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.