Approximate Iterative Algorithms

Name: Approximate Iterative Algorithms
Brand: Taylor & Francis Ltd
Price: 125.75 AUD
Availability: BackOrder

By: Anthony Louis Almudevar

Write A Review

Paperback | 10 October 2019 | Edition Number 1

At a Glance

Paperback
372 Pages

Dimensions(cm)
24.6 x 17.4 x 2.54

Paperback

RRP $139.00

$125.75

10%OFF

or 4 interest-free payments of $31.44 with

Available for Backorder. We will order this from our supplier however there isn't a current ETA.

Iterative algorithms often rely on approximate evaluation techniques, which may include statistical estimation, computer simulation or functional approximation. This volume presents methods for the study of approximate iterative algorithms, providing tools for the derivation of error bounds and convergence rates, and for the optimal design of such algorithms. Techniques of functional analysis are used to derive analytical relationships between approximation methods and convergence properties for general classes of algorithms. This work provides the necessary background in functional analysis and probability theory. Extensive applications to Markov decision processes are presented.

This volume is intended for mathematicians, engineers and computer scientists, who work on learning processes in numerical analysis and are involved with optimization, optimal control, decision analysis and machine learning.

Industry Reviews

"This is an excellent book on dynamic programming and Markov decision processes. Dynamic programming, invented by the late Richard Bellman, has created a new field of optimality and approximation theory. The author has divided his book into three parts: I: Mathematical background with 8 chapters, II: General theory of approximate iterative algorithms with 3 chapters, and III: Application to Markov decision processes with 6 chapters. [...] The author has elaborated the theory in the application to online parameter estimation and exploration schedule."

Nirode C. Mohanty (Huntington Beach), Zentralblatt MATH 1297-1

"Many real-life processes and program optimization tasks require approximations for their analysis and execution, as well asbeing recursive and requiring multiple iterations to achieve workable approximations. This rather dense and mathematically beautiful text provides the nexcessary background for the construction and development of algorithms to handle such tasks. [...] Thorough and mathematically rigorous throughout, the book will be useful to both pure mathematicians and programmers working in diverse fields from error analysis to machine learning."

2014 Ringgold, Inc., Portland, OR, USA

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.