scholarly journals A Majorization-Minimization Algorithm for Computing the Karcher Mean of Positive Definite Matrices

2017 ◽  
Vol 38 (2) ◽  
pp. 387-400 ◽  
Author(s):  
Teng Zhang
Filomat ◽  
2018 ◽  
Vol 32 (7) ◽  
pp. 2625-2634
Author(s):  
Monire Hajmohamadi ◽  
Rahmatollah Lashkaripour ◽  
Mojtaba Bakherad

In this paper, we generalize some matrix inequalities involving the matrix power means and Karcher mean of positive definite matrices. Among other inequalities, it is shown that if A = (A1,...,An) is an n-tuple of positive definite matrices such that 0 < m ? Ai ? M (i = 1,...,n) for some scalars m < M and ? = (w1,...,wn) is a weight vector with wi ? 0 and ?n,i=1 wi=1, then ?p (?n,i=1 wiAi)? ?p?p(Pt(?,A)) and ?p (?n,i=1 wiAi) ? ?p?p(?(?,A)), where p > 0,? = max {(M+m)2/4Mm,(M+m)2/42p Mm}, ? is a positive unital linear map and t ? [-1,1]\{0}.


2011 ◽  
Vol 435 (2) ◽  
pp. 307-322 ◽  
Author(s):  
Hosoo Lee ◽  
Yongdo Lim ◽  
Takeaki Yamazaki

Sign in / Sign up

Export Citation Format

Share Document