Incomplete projection algorithms for solving the convex feasibility problem

Numerical Algorithms

Volumn 18, Issue 2, 1998, Pages 177-193

  García Palomares, Ubaldo M ^a,b   González Castaño, Francisco J ^b  

^a UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

^b UNIVERSITY OF VIGO   (Spain)

Author keywords

Convex feasibility; Multi processing; Projections

Indexed keywords

EID: 22444455259     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1019165330848     Document Type: Article

References (19)

1. R. Aharoni, A. Berman and Y. Censor, An interior points algorithm for the convex feasibility problem, Adv. in Appl. Math. 4 (1983) 479-489.
2. R. Aharoni and Y. Censor, Block-iterative projection methods for parallel computation of solutions to convex feasibility problems, Linear Algebra Appl. 120 (1989) 165-175.
3. H.H. Bauschke and J.M. Borwein, On projection algorithms for solving convex feasibility problems, SIAM Rev. 38 (1996) 367-426.
4. J.P. Boyle and R.L. Dykstra, A Method for Finding Projections onto the Intersections of Convex Sets in Hilbert Spaces, Lecture Notes in Statistics 37 (Springer, Berlin, 1986) pp. 28-47.
5. D. Butnariu and Y. Censor, On the behavior of a block-iterative projection method for solving convex feasibility problems, Internat. J. Comput. Math. 34 (1990) 79-94.
6. Y. Censor, Iterative methods for the convex feasibility problem, Ann. Discrete Math. 20 (1984) 83-91.
7. Y. Censor, Parallel application of block-iterative methods in medical imaging and radiation therapy, Math. Programming 42 (1988) 307-325.
8. Y. Censor, M.D. Altschuler and W.D. Powlis, On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning, Inverse Problems 4 (1988) 607-623.
9. G. Cimmino, Calcolo approssimato per le soluzioni dei sistemi di equationi lineari, La Ricerca Scientifica 16, Ser. II, Anno IX(1) (1938) 326-333.
10. P.L. Combettes, Inconsistent signal feasibility problems: Least-squares solutions in a product space, IEEE Trans. Signal Processing 42 (1994) 2955-2966.
11. A.R. DePierro and A.N. lusem, A simultaneous projections method for linear inequalities, Linear Algebra Appl. 64 (1985) 243-253.
12. F. Deutsch, The method of alternating orthogonal projections, in: Approximation Theory, Spline Functions and Applications, ed. S.P. Sing (Kluwer Academic, Dordrecht, 1992) pp. 105-121.
13. R. Escalante and M. Raydán, Dykstra's algorithm for a constrained least-squares matrix problem, Numer. Linear Algebra Appl. 3 (1996) 459-471.
14. S.D. Flåm and J. Zowe, Relaxed outer projections, weighted averages and convex feasibility, BIT 30 (1990) 289-300.
15. U.M. García-Palomares, Parallel projected aggregation methods for solving the convex feasibility problem, SIAM J. Optim. 3 (1993) 882-900.
16. U.M. García-Palomares, Aplicación de los métodos de proyección en el problema de factibilidad convexa: Un repaso, Investigation Operativa 4 (1994) 229-245.
17. U.M. García-Palomares, A superlinearly convergent projection algorithm for solving the convex inequality problem, Oper. Res. Lett. 22 (1998) 97-103.
18. W.B. Gearhart and M. Koshy, Acceleration schemes for the method of alternating projections, J. Comput. Appl. Math. 26 (1989) 235-249.
19. J.L. Goffin, The relaxation method for solving systems of linear inequalities, Math. Oper. Res. 5 (1980) 388-414.