Cyclic subgradient projections

1. R. Aharoni, A. Berman and Y. Censor, “An interior points algorithm for the convex feasibility problem”,Advances in Applied Mathematics, to appear.

2. Y. Censor, D. Gustafson, A. Lent and H. Tuy, “A new approach to the emission computerized tomography problem: Calculating attenuation and concentration coefficients simultaneously”,IEEE Transactions on Nuclear Science NS-26 (1979) 2775–2779.

   Google Scholar 

3. Y. Censor and A. Lent, “A cyclic subgradient projections method for the convex feasibility problem”, Technical Report, Department of Mathematics, University of Haifa (July, 1980).

4. Y. Censor, “Iterative methods for the convex feasibility problem”,Annals of Discrete Mathematics, to appear.

5. I.I. Eremin, “On some iterative methods in convex programming”,Ekonomika i Matematichesky Methody 2 (1966) 870–886. [In Russian.]

   Google Scholar 

6. L.G. Gubin, B.T. Polyak and E.V. Raik, “The method of projections for finding the common point of convex sets”,USSR Computational Mathematics and Mathematical Physics 7 (1967) 1–24.

   Google Scholar 

7. W. Oettli, “Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints”,Journal of Approximation Theory 14 (1975) 43–50.

   Google Scholar 

8. E. Raik, “Fejer's type methods in Hilbert space”,Izvestija Akademii Nauk Estonskoy SSR 16 (1967) 286–293. [In Russian.]

   Google Scholar 

Download references