๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

(Approximate) iterated successive approximations algorithm for sequential decision processes

โœ Scribed by Canbolat, Pelin G.; Rothblum, Uriel G.


Book ID
125355301
Publisher
Springer US
Year
2012
Tongue
English
Weight
458 KB
Volume
208
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Successive Approximate Algorithm for Bes
โœ Shusheng Xu ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 275 KB

Suppose K is the intersection of a finite number of closed half-spaces [K i ] in a Hilbert space X, and x # X "K. Dykstra's cyclic projections algorithm is a known method to determine an approximate solution of the best approximation of x from K, which is denoted by P K (x). Dykstra's algorithm redu