The Riemannian Barzilai-Borwein method with nonmonotone line search and the matrix geometric mean computation
Bruno Iannazzo (bruno.iannazzodmi.unipg.it)
Abstract: The Barzilai-Borwein method, an effective gradient descent method with clever choice of the step-length, is adapted from nonlinear optimization to Riemannian manifold optimization. More generally, global convergence of a nonmonotone line-search strategy for Riemannian optimization algorithms is proved under some standard assumptions. By a set of numerical tests, the Riemannian Barzilai-Borwein method with nonmonotone line-search is shown to be competitive in several Riemannian optimization problems. When used to compute the matrix geometric mean, known as the Karcher mean of positive definite matrices, it notably outperforms existing first-order optimization methods.
Keywords: Riemannian optimization; manifold optimization; Barzilai-Borwein algorithm; nonmonotone line-search; Karcher mean; matrix geometric mean; positive definite matrix.
Category 1: Nonlinear Optimization (Other )
Citation: IMA Journal of Numerical Analysis, 38:1 (2018), pp. 495-517.
Entry Submitted: 12/23/2015
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|