Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Numerical Optimization with Computational Errors, Paperback / softback Book

Numerical Optimization with Computational Errors Paperback / softback

Part of the Springer Optimization and Its Applications series

Paperback / softback

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.   

Information

Other Formats

Save 0%

£71.00

£70.89

Item not Available
 
Free Home Delivery

on all orders

 
Pick up orders

from local bookshops

Information

Also in the Springer Optimization and Its Applications series  |  View all