메뉴 건너뛰기




Volumn 8, Issue C, 2001, Pages 23-36

Joint and separate convexity of the bregman distance

Author keywords

Bregman distance; convex function; joint convexity; separate convexity

Indexed keywords


EID: 77956679007     PISSN: 1570579X     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1570-579X(01)80004-5     Document Type: Chapter
Times cited : (94)

References (35)
  • 1
    • 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. Journal of Convex Analysis 4 (1997) 27-67
    • (1997) Journal of Convex Analysis , vol.4 , pp. 27-67
    • Bauschke, H.H.1    Borwein, J.M.2
  • 6
    • 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. U.S.S.R. Computational Mathematics and Mathematical Physics 7 (1967) 200-217
    • (1967) U.S.S.R. Computational Mathematics and Mathematical Physics , vol.7 , pp. 200-217
    • Bregman, L.M.1
  • 7
    • 0005327466 scopus 로고    scopus 로고
    • Proximity function minimization and the convex feasibility problem for jointly convex Bregman distances
    • Byrne C., and Censor Y. Proximity function minimization and the convex feasibility problem for jointly convex Bregman distances. Technical Report (1998)
    • (1998) Technical Report
    • Byrne, C.1    Censor, Y.2
  • 8
    • 77956655600 scopus 로고    scopus 로고
    • C. Byrne and Y. Censor. Proximity Function Minimization Using Multiple Bregman Projections, with Applications to Split Feasibility and Kullback-Leibler Distance Minimization. Technical Report: June 1999, Revised: April 2000, Annals of Operations Research, to appear.
    • C. Byrne and Y. Censor. Proximity Function Minimization Using Multiple Bregman Projections, with Applications to Split Feasibility and Kullback-Leibler Distance Minimization. Technical Report: June 1999, Revised: April 2000, Annals of Operations Research, to appear.
  • 9
    • 0031188734 scopus 로고    scopus 로고
    • Iterative Averaging of Entropic Projections for Solving Stochastic Convex Feasibility Problems
    • Butnariu D., Censor Y., and Reich S. Iterative Averaging of Entropic Projections for Solving Stochastic Convex Feasibility Problems. Computational Optimization and Applications 8 (1997) 21-39
    • (1997) Computational Optimization and Applications , vol.8 , pp. 21-39
    • Butnariu, D.1    Censor, Y.2    Reich, S.3
  • 17
    • 0001560954 scopus 로고
    • Information geometry and alternating minimization procedures
    • Csiszár I., and Tusnády G. Information geometry and alternating minimization procedures. Statistics and Decisions Supplement 1 (1984) 205-237
    • (1984) Statistics and Decisions , Issue.SUPPL. 1 , pp. 205-237
    • Csiszár, I.1    Tusnády, G.2
  • 20
    • 0043114004 scopus 로고
    • A short convergence proof of the EM algorithm for a specific Poisson model
    • Iusem A.N. A short convergence proof of the EM algorithm for a specific Poisson model. Revista Brasileira de Probabilidade e Estatistica 6 (1992) 57-67
    • (1992) Revista Brasileira de Probabilidade e Estatistica , vol.6 , pp. 57-67
    • Iusem, A.N.1
  • 21
    • 77956683067 scopus 로고    scopus 로고
    • Personal communication
    • A. N. Iusem. Personal communication.
    • Iusem, A.N.1
  • 22
    • 0031146730 scopus 로고    scopus 로고
    • Free-steering relaxation methods for problems with strictly convex costs and linear constraints
    • Kiwiel K.C. Free-steering relaxation methods for problems with strictly convex costs and linear constraints. Mathematics of Operations Research 22 (1997) 326-349
    • (1997) Mathematics of Operations Research , vol.22 , pp. 326-349
    • Kiwiel, K.C.1
  • 23
    • 0031190440 scopus 로고    scopus 로고
    • Proximal minimization methods with generalized Bregman functions
    • Kiwiel K.C. Proximal minimization methods with generalized Bregman functions. SIAM Journal on Control and Optimization 35 (1997) 1142-1168
    • (1997) SIAM Journal on Control and Optimization , vol.35 , pp. 1142-1168
    • Kiwiel, K.C.1
  • 24
    • 0032332405 scopus 로고    scopus 로고
    • Generalized Bregman projections in convex feasibility problems
    • Kiwiel K.C. Generalized Bregman projections in convex feasibility problems. Journal of Optimization Theory and Applications 96 (1998) 139-157
    • (1998) Journal of Optimization Theory and Applications , vol.96 , pp. 139-157
    • Kiwiel, K.C.1
  • 26
    • 0030304775 scopus 로고    scopus 로고
    • Convex analysis on the Hermitian matrices
    • Lewis A.S. Convex analysis on the Hermitian matrices. SIAM Journal on Optimization 6 (1996) 164-177
    • (1996) SIAM Journal on Optimization , vol.6 , pp. 164-177
    • Lewis, A.S.1
  • 29
  • 34
    • 0034187944 scopus 로고    scopus 로고
    • An inexact hybrid generalized proximal point methodalgorithm and some new results on the theory of Bregman functions
    • To appear in
    • M. V. Solodov and B. F. Svaiter. An inexact hybrid generalized proximal point methodalgorithm and some new results on the theory of Bregman functions. To appear in Mathematics of Operations Research.
    • Mathematics of Operations Research
    • Solodov, M.V.1    Svaiter, B.F.2


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