Incremental Gradient Method for Karcher Mean on Symmetric Cones
Sangho Kum () and
Sangwoon Yun ()
Additional contact information
Sangho Kum: Chungbuk National University
Sangwoon Yun: Sungkyunkwan University
Journal of Optimization Theory and Applications, 2017, vol. 172, issue 1, No 8, 155 pages
Abstract:
Abstract In this paper, we deal with the minimization problem for computing Karcher mean on a symmetric cone. The objective of this minimization problem consists of the sum of squares of the Riemannian distances with many given points in a symmetric cone. Moreover, the problem can be reduced to a bound-constrained minimization problem. These motivate us to adapt an incremental gradient method. So we propose an incremental gradient method and establish its global convergence properties exploiting the Lipschitz continuity of the gradient of the Riemannian distance function.
Keywords: Karcher mean; Incremental gradient method; Symmetric cone; 65K05; 90C25 (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://link.springer.com/10.1007/s10957-016-1000-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:172:y:2017:i:1:d:10.1007_s10957-016-1000-4
Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2
DOI: 10.1007/s10957-016-1000-4
Access Statistics for this article
Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull
More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().