A general iterative scheme with applications to convex optimization and related fields

References

• Agmon , S. 1954 . The relaxation method for linear inequalities . Canad. J. Math , 6 : 382 – 392 .
   Web of Science ®Google Scholar
• Baiocchi , C. and Capelo , A. 1988 . Variational and Quasivariational Inequalities - Applications to Free Boundary Problems , Moscow : Nauka .
   Google Scholar
• Bregman , L.M. 1965 . The determination of common points of convex sets by the method of successive projections , Vol. 162 , 487 – 490 . Dokl. Akad. Nauk SSR .
   Google Scholar
• Butnariu , D. and Censor , Y. 1965 . On the behaviour of a block-iterative projection method for solving convex feasibility problems . Internal J. of Computer Math , 34 to appear
   Google Scholar
• Censor , Y. 1981 . Row-action methods for huge and sparse systems and their applications . SIAM Rev , 23 : 444 – 466 .
   Web of Science ®Google Scholar
• Censor , Y. and Lent , A. 1982 . Cyclic subgradient projections . Math. Programming , 24 : 233 – 235 .
   Web of Science ®Google Scholar
• Censor , Y. 1984 . Iterative methods for the convex feasibility problem . Annals of Discrete Math , 20 : 83 – 91 .
   Google Scholar
• Eremin , I.I. 1965 . The relaxation method of solving systems of inequalities with convex functions on the left-hand sides , Vol. 160 , 994 – 996 . Dokl. Akad. Nauk SSR .
   Google Scholar
• Gurin , L.G. , Poljak , B.T. and Raik , E.V. 1967 . The method of projections for finding the common point of convex sets . Z. Vycisl. Mat. i Mat. Fiz , 7 : 1211 – 1228 .
   Google Scholar
• Herman , G.T. , Lent , A. and Rowland , S.W. 1973 . ART:mathematics and applications . J. Theoret. Btol , 42 : 1 – 32 .
   PubMed Web of Science ®Google Scholar
• Kaczmarz , S. 1937 . Angenaherte Auflosung von Systemen linearer Gleichungen . Bull. Internal Acad. Polon. Sci. Cl , 35 : 355 – 357 .
   Google Scholar
• Langenbach , A. 1984 . Vorlesungen zur hoheren Analysis , Berlin : Deutscher Verlag der Wissenschaften .
   Google Scholar
• Maess , G. 1979 . Iterative Lösung linearer Gleichungssysteme . Nova Acta Leopoldina , 52 ( 238 ) : 5 – 79 .
   Google Scholar
• Motzkin , T.S. and Schoenberg , I.J. 1954 . The relaxation method for linear inequalities . Canad. J. Math , 6 ( 238 ) : 393 – 404 .
   Google Scholar
• Oettli , W. 1975 . 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 . J. Annroximation Theory , 14 ( 238 ) : 43 – 50 .
   Google Scholar
• Poljak , B.T. 1969 . Minimization of nonsmooth functionals . Z. Vycisl. Mat. i Mat. Fiz , 9 ( 238 ) : 509 – 521 .
   Google Scholar
• Schott , D. 1984 . Konvergenzsätze für Verallgemeinerungen von PSH- und SPA-Verfahren . Math.Nachr , 118 ( 238 ) : 89 – 103 .
   Google Scholar
• Schott , D. 1990 . Convergence statements for projection type linear iterative methods with relaxations . Z. Anal. Anw , 9 ( 238 ) : 327 – 341 .
   Google Scholar
• Schott , D. 1990 . A general iterative scheme with applications to convex optimization and related fields , Pedagogical University Güstrow . Preprint 1
   Google Scholar
• Trummer , M.R. 1981 . Reconstructing pictures from projections:On the convergence of the ART algorithm with relaxation . Computing , 26 : 189 – 195 .
   Web of Science ®Google Scholar
• Zeidler , E. 1977 . Vorlesungen uber nichtlineare Funktionalanalysis III Teubner Leipzig
   Google Scholar