메뉴 건너뛰기




Volumn 8, Issue C, 2001, Pages 87-99

Bregman-legendre multidistance projection algorithms for convex feasibility and optimization

Author keywords

[No Author keywords available]

Indexed keywords


EID: 77956682929     PISSN: 1570579X     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1570-579X(01)80008-2     Document Type: Chapter
Times cited : (32)

References (15)
  • 1
    • 0030246542 scopus 로고    scopus 로고
    • On projection algorithms for solving convex feasibility problems
    • Bauschke H.H., and Borwein J.M. On projection algorithms for solving convex feasibility problems. SIAM Review 38 (1996) 367-426
    • (1996) SIAM Review , vol.38 , pp. 367-426
    • Bauschke, H.H.1    Borwein, J.M.2
  • 2
    • 21744459385 scopus 로고    scopus 로고
    • Legendre functions and the method of random Bregman projections
    • Bauschke H.H., and Borwein J.M. Legendre functions and the method of random Bregman projections. J. of Convex Analysis 4 (1997) 27-67
    • (1997) J. of Convex Analysis , vol.4 , pp. 27-67
    • Bauschke, H.H.1    Borwein, J.M.2
  • 3
    • 49949144765 scopus 로고
    • The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
    • Bregman L.M. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics 7 (1967) 200-217
    • (1967) USSR Computational Mathematics and Mathematical Physics , vol.7 , pp. 200-217
    • Bregman, L.M.1
  • 4
    • 0030150471 scopus 로고    scopus 로고
    • Block-iterative methods for image reconstruction from projections
    • Byrne C.L. Block-iterative methods for image reconstruction from projections. IEEE Transactions on Image Processing IP-5 (1996) 792-794
    • (1996) IEEE Transactions on Image Processing , vol.IP-5 , pp. 792-794
    • Byrne, C.L.1
  • 5
    • 0001045771 scopus 로고    scopus 로고
    • Iterative projection onto convex sets using multiple Bregman distances
    • Byrne C.L. Iterative projection onto convex sets using multiple Bregman distances. Inverse Problems 15 (1999) 1295-1313
    • (1999) Inverse Problems , vol.15 , pp. 1295-1313
    • Byrne, C.L.1
  • 6
    • 0000472626 scopus 로고    scopus 로고
    • Block-iterative Interior point optimization methods for image reconstruction from limited data
    • Byrne C.L. Block-iterative Interior point optimization methods for image reconstruction from limited data. Inverse Problems 16 (2000) 1405-1419
    • (2000) Inverse Problems , vol.16 , pp. 1405-1419
    • Byrne, C.L.1
  • 7
    • 0035565698 scopus 로고    scopus 로고
    • Proximity function minimization using multiple Bregmanprojections, with applications to split feasibility and Kullback-Leibler distance minimization
    • accepted for publication
    • C. L. Byrne and Y. Censor, Proximity function minimization using multiple Bregmanprojections, with applications to split feasibility and Kullback-Leibler distance minimization, Annals of Operations Research accepted for publication.
    • Annals of Operations Research
    • Byrne, C.L.1    Censor, Y.2
  • 8
    • 0000424337 scopus 로고
    • A multiprojection algorithm using Bregman projections in a product space
    • Censor Y., and Elfving T. A multiprojection algorithm using Bregman projections in a product space. Numerical Algorithms 8 (1994) 221-239
    • (1994) Numerical Algorithms , vol.8 , pp. 221-239
    • Censor, Y.1    Elfving, T.2
  • 10
    • 0031496463 scopus 로고    scopus 로고
    • A projection-based algorithm for consistent and inconsistent constraints
    • Kotzer T., Cohen N., and Shamir J. A projection-based algorithm for consistent and inconsistent constraints. SIAM J. Optim. 7 2 (1997) 527-546
    • (1997) SIAM J. Optim. , vol.7 , Issue.2 , pp. 527-546
    • Kotzer, T.1    Cohen, N.2    Shamir, J.3
  • 11
    • 0000518587 scopus 로고
    • An iterative formula for Fredholm integral equations of the first kinds
    • Landweber L. An iterative formula for Fredholm integral equations of the first kinds. Amer. J. of Math. 73 (1951) 615-624
    • (1951) Amer. J. of Math. , vol.73 , pp. 615-624
    • Landweber, L.1
  • 12
    • 0023363121 scopus 로고
    • A theoretical study of some maximum likelihood algorithms for emission and transmission tomography
    • Lange K., Bahn M., and Little R. A theoretical study of some maximum likelihood algorithms for emission and transmission tomography. IEEE Trans. Med. Imag. 6 (1987) 106-114
    • (1987) IEEE Trans. Med. Imag. , vol.6 , pp. 106-114
    • Lange, K.1    Bahn, M.2    Little, R.3
  • 13
    • 77956706254 scopus 로고    scopus 로고
    • An interior point iterative reconstruction algorithm incorporating upper and lower bounds, with application to SPECT transmission imaging
    • submitted for publication
    • M. Narayanan, C. L. Byrne and M. King, An interior point iterative reconstruction algorithm incorporating upper and lower bounds, with application to SPECT transmission imaging, IEEE Trans. Medical Imaging, submitted for publication.
    • IEEE Trans. Medical Imaging
    • Narayanan, M.1    Byrne, C.L.2    King, M.3
  • 14
    • 0004267646 scopus 로고
    • Princeton University Press, Princeton, New Jersey
    • Rockafellar R.T. Convex Analysis (1970), Princeton University Press, Princeton, New Jersey
    • (1970) Convex Analysis
    • Rockafellar, R.T.1
  • 15
    • 0002605032 scopus 로고
    • Mathematical theory of image restoration by the method of convex projections
    • Stark H. (Ed), Academic Press, Orlando, Florida, USA
    • Youla D.C. Mathematical theory of image restoration by the method of convex projections. In: Stark H. (Ed). Image Recovery: Theory and Applications (1987), Academic Press, Orlando, Florida, USA 29-78
    • (1987) Image Recovery: Theory and Applications , pp. 29-78
    • Youla, D.C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.