Gradient Method for Optimization on Riemannian Manifolds with Lower Bounded Curvature

DOI10.1137/18M1180633zbMath1429.90051arXiv1806.02694OpenAlexW2981099578WikidataQ115246931 ScholiaQ115246931MaRDI QIDQ5237307

Maurício Silva Louzeiro, L. F. Prudente, Orizon P. Ferreira

Publication date: 17 October 2019

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.02694

zbMATH Keywords

Riemannian manifoldconvex programminggradient methoditeration-complexity boundlower bounded curvature

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

Iterative algorithms for monotone variational inequality and fixed point problems on Hadamard manifolds ⋮ Dynamical systems for solving variational inclusion and fixed point problems on Hadamard manifolds ⋮ Variational inequalities governed by strongly pseudomonotone vector fields on Hadamard manifolds ⋮ Fenchel conjugate via Busemann function on Hadamard manifolds ⋮ A trust region method for solving multicriteria optimization problems on Riemannian manifolds ⋮ Riemannian stochastic variance-reduced cubic regularized Newton method for submanifold optimization ⋮ A modified proximal point method for DC functions on Hadamard manifolds ⋮ Constraint qualifications and optimality criteria for nonsmooth multiobjective programming problems on Hadamard manifolds ⋮ On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds ⋮ An adaptive Riemannian gradient method without function evaluations ⋮ Well-posedness of an interaction model on Riemannian manifolds ⋮ First Order Methods for Optimization on Riemannian Manifolds ⋮ Convergence Analysis of Gradient Algorithms on Riemannian Manifolds without Curvature Constraints and Application to Riemannian Mass ⋮ A strongly convergent proximal point method for vector optimization ⋮ Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds ⋮ Fenchel duality theory and a primal-dual algorithm on Riemannian manifolds ⋮ Iterative algorithm for singularities of inclusion problems in Hadamard manifolds ⋮ Proximal gradient method for nonconvex and nonsmooth optimization on Hadamard manifolds

Uses Software

• Matrix Means Toolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Concepts and techniques of optimization on the sphere
• Gradient methods for minimizing composite functions
• Statistics on the manifold of multivariate normal distributions: theory and application to diffusion tensor MRI processing
• Optimal placement of a deposit between markets: Riemann-Finsler geometrical approach
• Minimizing a differentiable function over a differential manifold
• Lattices in spaces of nonpositive curvature
• Smooth nonlinear optimization of \(\mathbb R^n\)
• Introductory lectures on convex optimization. A basic course.
• Geometric means
• Contributions to the study of monotone vector fields
• On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
• Computing the Karcher mean of symmetric positive definite matrices
• Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
• Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
• A survey and comparison of contemporary algorithms for computing the matrix geometric mean
• A framework for generalising the Newton method and other iterative methods from Euclidean space to manifolds
• Non-existence of continuous convex functions on certain Riemannian manifolds
• On the Convergence of Gradient Descent for Finding the Riemannian Center of Mass
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Variational Inequalities for Set-Valued Vector Fields on Riemannian Manifolds: Convexity of the Solution Set and the Proximal Point Algorithm
• Weak Sharp Minima on Riemannian Manifolds
• Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds
• The Geometry of Algorithms with Orthogonality Constraints
• Optimization Techniques on Riemannian Manifolds
• Full convergence of the steepest descent method with inexact line searches
• Global rates of convergence for nonconvex optimization on manifolds
• Conic Geometric Optimization on the Manifold of Positive Definite Matrices
• The Gradient Projection Method Along Geodesics
• Domains of positivity
• Benchmarking optimization software with performance profiles.