Global convergence of Riemannian line search methods with a Zhang-Hager-type condition
From MaRDI portal
Publication:2084256
DOI10.1007/s11075-022-01298-8zbMath1505.65218OpenAlexW4224217415WikidataQ115381561 ScholiaQ115381561MaRDI QIDQ2084256
Publication date: 18 October 2022
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-022-01298-8
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Methods of global Riemannian geometry, including PDE methods; curvature restrictions (53C21)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions
- A splitting method for orthogonality constrained problems
- Efficient rank reduction of correlation matrices
- Globally convergent optimization algorithms on Riemannian manifolds: Uniform framework for unconstrained and constrained optimization
- Minimizing a differentiable function over a differential manifold
- Matrix completion via a low rank factorization model and an augmented Lagrangean succesive overrelaxation algorithm
- Convergence rate of descent method with new inexact line-search on Riemannian manifolds
- Projected nonmonotone search methods for optimization with orthogonality constraints
- A Riemannian conjugate gradient method for optimization on the Stiefel manifold
- Hybrid Riemannian conjugate gradient methods with global convergence properties
- Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization
- A brief introduction to manifold optimization
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Trace optimization and eigenproblems in dimension reduction methods
- Generalized power method for sparse principal component analysis
- Optimization Methods on Riemannian Manifolds and Their Application to Shape Space
- Manopt, a Matlab toolbox for optimization on manifolds
- A Broyden Class of Quasi-Newton Methods for Riemannian Optimization
- KSSOLV—a MATLAB toolbox for solving the Kohn-Sham equations
- A Riemannian variant of the Fletcher-Reeves conjugate gradient method for stochastic inverse eigenvalue problems with partial eigendata
- Adaptive Quadratically Regularized Newton Method for Riemannian Optimization
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- The Geometry of Algorithms with Orthogonality Constraints
- Optimization Techniques on Riemannian Manifolds
- The Riemannian Barzilai–Borwein method with nonmonotone line search and the matrix geometric mean computation
- A non-monotone linear search algorithm with mixed direction on Stiefel manifold
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Riemannian Optimization on the Symplectic Stiefel Manifold
- Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints
- A new, globally convergent Riemannian conjugate gradient method
- The Gradient Projection Method Along Geodesics
