Computational acceleration of projection algorithms for the linear best approximation problem
暂无分享,去创建一个
[1] Yair Censor,et al. On Diagonally Relaxed Orthogonal Projection Methods , 2007, SIAM J. Sci. Comput..
[2] Y. Censor,et al. Extensions of Hildreth’s Row-Action Method for Quadratic Programming , 2006 .
[3] Dan Gordon,et al. Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems , 2005, SIAM J. Sci. Comput..
[4] Marcos Raydan,et al. Robust Stopping Criteria for Dykstra's Algorithm , 2005, SIAM J. Sci. Comput..
[5] Patrick L. Combettes,et al. A block-iterative surrogate constraint splitting method for quadratic signal recovery , 2003, IEEE Trans. Signal Process..
[6] Ming Jiang,et al. Convergence Studies on Iterative Algorithms for Image Reconstruction , 2003, IEEE Trans. Medical Imaging.
[7] N. Higham. Computing the nearest correlation matrix—a problem from finance , 2002 .
[8] Marcos Raydan,et al. Primal and polar approach for computing the symmetric diagonally dominant projection , 2002, Numer. Linear Algebra Appl..
[9] Yair Censor,et al. BICAV: An Inherently Parallel Algorithm for Sparse Systems with Pixel-Dependent Weighting , 2001, IEEE Trans. Medical Imaging.
[10] Yair Censor,et al. Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems , 2001, Parallel Comput..
[11] Heinz H. Bauschke,et al. A Weak-to-Strong Convergence Principle for Fejé-Monotone Methods in Hilbert Spaces , 2001, Math. Oper. Res..
[12] Heinz H. Bauschke,et al. Dykstras algorithm with bregman projections: A convergence proof , 2000 .
[13] L. Marks,et al. A feasible set approach to the crystallographic phase problem. , 1999, Acta crystallographica. Section A, Foundations of crystallography.
[14] Marcos Raydan,et al. Computing the nearest diagonally dominant matrix , 1998, Numer. Linear Algebra Appl..
[15] Frank Deutsch,et al. Two generalizations of Dykstra’s cyclic projections algorithm , 1997, Math. Program..
[16] Marcos Raydan,et al. Dykstra's Algorithm for a Constrained Least-squares Matrix Problem , 1996, Numer. Linear Algebra Appl..
[17] Heinz H. Bauschke,et al. On Projection Algorithms for Solving Convex Feasibility Problems , 1996, SIAM Rev..
[18] Heinz H. Bauschke. The Approximation of Fixed Points of Compositions of Nonexpansive Mappings in Hilbert Space , 1996 .
[19] Heinz H. Bauschke,et al. Dykstra's Alternating Projection Algorithm for Two Sets , 1994 .
[20] Heinz H. Bauschke,et al. On the convergence of von Neumann's alternating projection algorithm for two sets , 1993 .
[21] Paul Tseng,et al. Dual coordinate ascent methods for non-strictly convex minimization , 1993, Math. Program..
[22] Patrick L. Combettes,et al. Signal recovery by best feasible approximation , 1993, IEEE Trans. Image Process..
[23] R. Wittmann. Approximation of fixed points of nonexpansive mappings , 1992 .
[24] Alvaro R. De Pierro,et al. On the convergence of Han's method for convex programming with quadratic objective , 1991, Math. Program..
[25] Patrick L. Combettes,et al. The foundations of set theoretic estimation , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.
[26] R. Mathar,et al. A cyclic projection algorithm via duality , 1989 .
[27] Y. Censor,et al. On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning , 1988 .
[28] F. T. Wright,et al. Order restricted statistical inference , 1988 .
[29] Shih-Ping Han. A parallel algorithm for a class of convex programs , 1988 .
[30] Shih-Ping Han,et al. A successive projection method , 1988, Math. Program..
[31] R. Dykstra. An Iterative Procedure for Obtaining $I$-Projections onto the Intersection of Convex Sets , 1985 .
[32] R. Dykstra. An Algorithm for Restricted Least Squares Regression , 1983 .
[33] S. Reich. Strong convergence theorems for resolvents of accretive operators in Banach spaces , 1980 .
[34] W. G. Dotson,et al. Approximating fixed points of nonexpansive mappings , 1974 .
[35] B. Halpern. Fixed points of nonexpanding maps , 1967 .
[36] Felix E. Browder,et al. Convergence of approximants to fixed points of nonexpansive nonlinear mappings in banach spaces , 1967 .
[37] Clifford Hildreth,et al. A quadratic programming procedure , 1957 .
[38] J. Neumann. On Rings of Operators. Reduction Theory , 1949 .
[39] S. Stević. APPROXIMATING FIXED POINTS OF NONEXPANSIVE MAPPINGS , 2006 .
[40] Yair Censor,et al. MATHEMATICAL OPTIMIZATION FOR THE INVERSE PROBLEM OF INTENSITY MODULATED RADIATION THERAPY , 2003 .
[41] Yair Censor,et al. Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem , 2002, SIAM J. Matrix Anal. Appl..
[42] Y. Censor,et al. BICAV: a block-iterative parallel algorithm for sparse systems with pixel-related weighting , 2001, IEEE Transactions on Medical Imaging.
[43] Yair Censor,et al. The Dykstra algorithm with Bregman projec-tions , 1998 .
[44] I. Yamada,et al. Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings , 1998 .
[45] Y. Censor,et al. Parallel Optimization:theory , 1997 .
[46] Y. Censor,et al. Parallel Optimization: Theory, Algorithms, and Applications , 1997 .
[47] P. L. Combettes,et al. The Convex Feasibility Problem in Image Recovery , 1996 .
[48] G. Crombez,et al. Finding projections onto the intersection of convex sets in hilbert spaces , 1995 .
[49] P. L. Combettes. Construction d'un point fixe commun à une famille de contractions fermes , 1995 .
[50] Hein Hundal,et al. The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case , 1994 .
[51] P. L. Combettes,et al. Foundation of set theoretic estimation , 1993 .
[52] A. Pierro,et al. A simultaneous iterative method for computing projections on polyhedra , 1987 .
[53] R. Dykstra,et al. A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces , 1986 .
[54] Gabor T. Herman,et al. Image reconstruction from projections : the fundamentals of computerized tomography , 1980 .
[55] John von Neumann,et al. Rings of operators , 1961 .