The multiple-sets split feasibility problem and its applications for inverse problems

Inverse Problems

Volumn 21, Issue 6, 2005, Pages 2071-2084

  Censor, Yair ^a   Elfving, Tommy ^b   Kopf, Nirit ^a   Bortfeld, Thomas ^c  

^a UNIVERSITY OF HAIFA   (Israel)

^b LINKÖPING UNIVERSITY   (Sweden)

^c MASSACHUSETTS GENERAL HOSPITAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INVERSE PROBLEMS; MATHEMATICAL OPERATORS; MATHEMATICAL TRANSFORMATIONS; RADIOTHERAPY;

CLOSED CONVEX SETSS; PROXIMITY FUNCTIONS;

SET THEORY;

EID: 28544451131     PISSN: 02665611     EISSN: 13616420     Source Type: Journal    
DOI: 10.1088/0266-5611/21/6/017     Document Type: Article

References (37)

1. Alber M and Nüsslin F 2000 Intensity modulated photon beams subject to a minimal surface smoothing constraint Phys. Med. Biol. 45 N49-52
2. Aubin J P and Cellina A 1984 Differential Inclusions: Set-Valued Maps and Viability Theory (Berlin: Springer)
3. Baillon J and Haddad G 1977 Quelques propriétés des opérateurs angel-bornés et n-cycliquement monotones Isr. J. Math. 26 137-50
4. Bauschke H H and Borwein J M 1996 On projection algorithms for solving convex feasibility problems SIAM Rev. 38 367-426
5. Bertsekas D P 1995 Nonlinear Programming (Belmont, MA: Athena Scientific)
6. Bertsekas D P 2003 Convex Analysis and Optimization (Belmont, MA: Athena Scientific)
7. Bertsekas D P and Tsitsiklis J N 1989 Parallel and Distributed Computation: Numerical Methods (Englewood Cliffs, NJ: Prentice-Hall)
8. Butnariu D, Censor Y and Reich S 1997 Iterative averaging of entropic projections for solving stochastic convex feasibility problems Comput. Optim. Appl. 8 21-39
9. Byrne C 2002 Iterative oblique projection onto convex sets and the split feasibility problem Inverse Problems 18 441-53
10. Byrne C 2004 A unified treatment of some iterative algorithms in signal processing and image reconstruction Inverse Problems 20 103-20
11. Byrne C and Censor Y 2001 Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback-Leibler distance minimization Ann. Oper. Res. 105 77-98
12. Cegielski A 2004 Convergence of the projected surrogate constraints method for the linear split feasibility problems Technical Report, 14 September Institute of Mathematics, University of Zielona Góra, Zielona Góra, Poland
13. Censor Y 1981 Row-action methods for huge and sparse systems and their applications SIAM Rev. 23 444-66
14. Censor Y, Bortfeld T, Martin B and Trofimov A 2005 The split feasibility model leading to a unified approach for inversion problems in intensity-modulated radiation therapy Technical Report, 20 April Department of Mathematics, University of Haifa, Haifa, Israel
15. Censor Y, De Pierro A R and Zaknoon M 2004 Steered sequential projections for the inconsistent convex feasibility problem Nonlinear Anal. Theory Methods Appl. A 59 385-405
16. Censor Y and Elfving T 1994 A multiprojection algorithm using Bregman projections in a product space Numer. Algorithms 8 221-39
17. Censor Y, Gordon D and Gordon R 2001 BICAV: A block-iterative, parallel algorithm for sparse systems with pixel-related weighting IEEE Trans. Med. Imaging 20 1050-60
18. Censor Y and Lent A 1982 Cyclic subgradient projections Math. Program. 24 233-5
19. Censor Y and Zenios S A 1997 Parallel Optimization: Theory, Algorithms, and Applications (New York: Oxford University Press)
20. Combettes P L 1996 The convex feasibility problem in image recovery Adv. Imaging Electron Phys. 95 155-270
21. Deutsch F 1992 The method of alternating orthogonal projections Approximation Theory, Spline Functions and Applications ed S P Singh (Dordrecht: Kluwer) pp 105-21
22. Dolidze Z O 1984 On convergence of an analog of the gradient method Ekonomika Mat. Metody 20 755-8
23. Eremin I I 1969 Fejér mappings and convex programming Siberian Math. J. 10 762-72
24. Golshtein E G and Tretyakov N 1996 Modified Lagrangians and Monotone Maps in Optimization (New York: Wiley)
25. Herman G T 1980 Image Reconstruction from Projections: The Fundamentals of Computerized Tomography (New York: Academic)
26. Herman G T and Meyer L B 1993 Algebraic reconstruction techniques can be made computationally efficient IEEE Trans. Med. Imaging 12 600-9
27. Hiriart-Urruty J-B and Lemaréchal C 2001 Fundamentals of Convex Analysis (Berlin: Springer)
28. Kessen A, Grosser K and Bortfeld T 2000 Simplification of IMRT intensity maps by means of 1-D and 2-D median-filtering during the iterative calculation Proc. 13th Int. Conf. on the Use of Computers in Radiation Therapy ed W Schlegel and T Bortfeld (Heidelberg: Springer) pp 545-7
29. Palta J R and Mackie T R (ed) 2003 Intensity-Modulated Radiation Therapy: The State of The Art (Medical Physics Monograph no 29) (Madison, WI: American Association of Physicists in Medicine, Medical Physics Publishing)
30. Qu B and Xiu N 2005 A note on the CQ algorithm for the split feasibility problem Inverse Problems 21 1-11
31. Rockafellar R T 1970 Convex Analysis (Princeton, NJ: Princeton University Press)
32. Stark H and Yang Y 1998 Vector Space Projections: A Numerical Approach to Signal and Image Processing, Neural Nets, and Optics (New York: Wiley)
33. Thieke C, Bortfeld T, Niemierko A and Nill S 2003 From physical dose constraints to equivalent uniform dose constraints in inverse radiotherapy planning Med. Phys. 30 2332-9
34. Webb S, Convery D J and Evans P M 1998 Inverse planning with constraints to generate smoothed intensity-modulated beams Phys. Med. Biol. 43 2785-94
35. Wu Q, Mohan R, Niemierko A and Schmidt-Ullrich R 2002 Optimization of intensity-modulated radiotherapy plans based on the equivalent uniform dose Int. J. Radiat. Oncol. Biol. Phys. 52 224-35
36. Yang Q 2004 The relaxed CQ algorithm solving the split feasibility problem Inverse Problems 20 1261-6
37. Zhao J and Yang Q 2005 Several solution methods for the split feasibility problem Inverse Problems 21 1791-9