The Riemannian Barzilai-Borwein method with nonmonotone line search and the matrix geometric mean computation
DOI10.1093/IMANUM/DRX015zbMATH Open1477.65096OpenAlexW2789764089WikidataQ115274945 ScholiaQ115274945MaRDI QIDQ4555945FDOQ4555945
Authors: Bruno Iannazzo, Margherita Porcelli 
Publication date: 23 November 2018
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imanum/drx015
Recommendations
- A Riemannian BFGS method for nonconvex optimization problems
- A Riemannian BFGS method without differentiated retraction for nonconvex optimization problems
- Computing the matrix geometric mean: Riemannian versus Euclidean conditioning, implementation techniques, and a Riemannian BFGS method.
- \(R\)-linear convergence of the Barzilai and Borwein gradient method
- An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization
positive definite matrixKarcher meanRiemannian optimizationnonmonotone line searchmatrix geometric meanmanifold optimizationBarzilai-Borwein algorithm
Cited In (30)
- Riemannian Optimization on the Symplectic Stiefel Manifold
- Geometric means of quasi-Toeplitz matrices
- Computing the matrix geometric mean: Riemannian versus Euclidean conditioning, implementation techniques, and a Riemannian BFGS method.
- A feasible method for general convex low-rank SDP problems
- Scaled fixed point algorithm for computing the matrix square root
- Algorithms for approximating means of semi-infinite quasi-Toeplitz matrices
- New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
- Computing the Action Ground State for the Rotating Nonlinear Schrödinger Equation
- A collection of efficient retractions for the symplectic Stiefel manifold
- Trace Lasso regularization for adaptive sparse canonical correlation analysis via manifold optimization approach
- Averaging symmetric positive-definite matrices
- A limited-memory Riemannian symmetric rank-one trust-region method with a restart strategy
- Nonmonotone local minimax methods for finding multiple saddle points
- Adaptive quadratically regularized Newton method for Riemannian optimization
- New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition
- Spectral residual method for nonlinear equations on Riemannian manifolds
- Delayed gradient methods for symmetric and positive definite linear systems
- An efficient damped Newton-type algorithm with globalization strategy on Riemannian manifolds
- Implicit steepest descent algorithm for optimization with orthogonality constraints
- Geometrical inverse matrix approximation for least-squares problems and acceleration strategies
- A Riemannian rank-adaptive method for low-rank matrix completion
- Title not available (Why is that?)
- The derivative of the matrix geometric mean with an application to the nonnegative decomposition of tensor grids
- Nonmonotone feasible arc search algorithm for minimization on Stiefel manifold
- A global Newton method for the nonsmooth vector fields on Riemannian manifolds
- Optimization schemes on manifolds for structured matrices with fixed eigenvalues
- Stein-based preconditioners for weak-constraint 4D-var
- Global convergence of Riemannian line search methods with a Zhang-Hager-type condition
- Solving graph equipartition SDPs on an algebraic variety
- Riemannian optimization via Frank-Wolfe methods
This page was built for publication: The Riemannian Barzilai-Borwein method with nonmonotone line search and the matrix geometric mean computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4555945)
