Interval underrelaxed bregman's method with an application

References

• Bregman , L.M. 1967 . The relaxation method of finding the common point of convex sets and its application to the solution of problems in comvex programming . USSR Computational Mathematics and Mathematical Physics , 7 : 200 – 217 .
   Google Scholar
• Censor , Y. 1981 . Row action methods for huge and sparse systems ans its applications . SIAM Review , 23 : 444 – 464 .
   Web of Science ®Google Scholar
• Censor , Y. , Elfving , T. and Herman , G.T. 1977 . “ Special purpose algorithms for linearly constrained entropy maxization ” . In Maximum Entropy and Bayesian Spectral Analysis and Estimation Problems , Edited by: Smith , C.R. and Erickson , G.J. 241 – 254 . Reidel : Dordrecht .
   Google Scholar
• Censor , Y. and Zenios , S.A. 1993 . “ 190 Colóquio Brasileiro de Matem á Pura e Aplicada ” . In Introduction to Methods of Parallel Optimization , Brazil : Rio de Janeiro .
   Google Scholar
• Censor , Y. , De Pierro , A.R. , Elfving , T. , Herman , G. and Iusem , A.N. 1990 . “ On iterative methods for linearly constrained entropy maximization ” . In In Numerical Analysis and Mathematical Modelling , Vol. 24 , 145 – 163 . Banach Center Puplications .
   Google Scholar
• Censor , Y. , De Pierro , A.R. and Iusem , A.N. 1991 . Optimization of Burg's entropy over linear constrains . Applied Numerical Mathematics , 7 : 151 – 165 .
   Web of Science ®Google Scholar
• Censor , Y. and Lent , A. 1981 . An iterative row action method for interval convex programming . Journal of Optimization Theory and Applications , 34 : 321 – 353 .
   Web of Science ®Google Scholar
• Censor , Y. and Zenios , S.A. 1992 . The proximal minimization algorithm with D functions . Journal of Optimization theory and Applications , 73 ( 3 ) : 455 – 468 .
   Google Scholar
• De Pierro , A.R. and Iusem , A.N. 1986 . A relaxed version of Bergman's method for convex programming . Journal of Optimization Theory and Applications , 51 ( 3 ) : 421 – 440 .
   Web of Science ®Google Scholar
• Herman , G. 1980 . Image Reconstruction from Projections, the fundamentals of Computerized Tomography , New York : Academic Press .
   Google Scholar
• Hildreth , G. 1957 . A quadratic programming procedure . Naval Research Logistics Quarterly , 4 : 79 – 85 . erratum ibid p361
   Google Scholar
• Iusem , A.N. and De Pierro , A.R. 1987 . A simultaneous interative method for computing projections on polyhedra . SIAM journal on control and Optimization , 25 : 231 – 243 .
   Web of Science ®Google Scholar
• Iusem , A.N. and Teboulle , M. 1992 . A primal dual iterative algorithm for a mzximum likelihood estiamtion problem . Computational Statistics and Data Analysis , 14 : 443 – 456 .
   Google Scholar
• Lent , A. 1977 . “ A convergent algorithm for maximum entropy image restoration with medical X ray applications ” . In In Image Analysis and Evalution , Edited by: Show , R. 249 – 257 . Washington, D.C : Society of Photographic Scientists and Engineers .
   Google Scholar
• Lent , A. and Censor , Y. 1980 . Extensions of Hildreth's row action method for convex programming . SIAM Journal of Control and Optimization , 18 : 444 – 454 .
   Web of Science ®Google Scholar
• Nielsen , S. and Zenios , S.A. 1992 . Massively parallel algorithms for singly constrained convex programs . ORSA Journal of Computing , 4
   Google Scholar
• Nielson , S. and Zenios , S.A. 1993 . Proximal minizations with D functions and the massively parallell solution of linear network programs . Computational Optimization and Applications , 1 : 375 – 398 .
   Google Scholar
• Shimaz Y. Fukushima M. Ibaraki T. A Succesive over relaxation method for quadratic programming problems with interval constrints Department of Applied Mathematics and Physics FAculty of Engineering Kyoto University 1992 Technicla Report 92004
   Google Scholar
• Zenios , S.A. 1991 . On the fine grain decomposition of multicommodity transportation problems . SIAM Journal on Optimazation , 1 : 643 – 669 .
   Web of Science ®Google Scholar