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