On String-Averaging for Sparse Problems and On the Split Common Fixed Point Problem
作者： Yair Censor , Alexander Segal
DOI:
关键词:
摘要: We review the common fixed point problem for class of directed operators. This is important because many commonly used nonlinear operators in convex optimization belong to it. present our recent definition sparseness a family and discuss string-averaging algorithmic scheme that favorably handles points when sparse. also some results on multiple split which requires find one space whose image under linear transformation another space.
optimization-online.org 
haifa.ac.il 参考文章(64)
Yair Al Censor, Stavros A. Zenios, Parallel Optimization: Theory, Algorithms, and Applications ,(1997)
Charles Byrne, Bregman-Legendre Multidistance Projection Algorithms for Convex Feasibility and Optimization Studies in Computational Mathematics. ,vol. 8, pp. 87- 99 ,(2001) , 10.1016/S1570-579X(01)80008-2
Gilbert Crombez, Non-monotoneous parallel iteration for solving convex feasibility problems Kybernetika. ,vol. 39, pp. 547- 560 ,(2003)
Michele Benzi, GIANFRANCO CIMMINO'S CONTRIBUTIONS TO NUMERICAL MATHEMATICS ,(2004)
Hyang-Joo Rhee, AN APPLICATION OF THE STRING AVERAGING METHOD TO ONE-SIDED BEST SIMULTANEOUS APPROXIMATION Pure and Applied Mathematics. ,vol. 10, pp. 49- 56 ,(2003)
Gabor T. Herman, Image reconstruction from projections : the fundamentals of computerized tomography Academic Press. ,(1980)
Frank Deutsch, Best Approximation in Inner Product Spaces ,(2001)
Y. Censor, T. Elfving, G.T. Herman, Averaging Strings of Sequential Iterations for Convex Feasibility Problems Studies in Computational Mathematics. ,vol. 8, pp. 101- 113 ,(2001) , 10.1016/S1570-579X(01)80009-4
Yongyi Yang, Henry Stark, Yongi Yang, Vector Space Projections: A Numerical Approach to Signal and Image Processing, Neural Nets, and Optics ,(1998)