A Riemannian conjugate gradient method for optimization on the Stiefel manifold
type: Item
instance of: scholarly article
title: A Riemannian conjugate gradient method for optimization on the Stiefel manifold
zbMATH Open document ID: 1401.90230
author: Xiaojing Zhu
published in: Computational Optimization and Applications
publication date: 2017-07-28T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 49Q99
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6754770
zbMATH Keywords: Riemannian optimization
zbMATH Keywords: Stiefel manifold
zbMATH Keywords: conjugate gradient method
zbMATH Keywords: retraction
zbMATH Keywords: vector transport
zbMATH Keywords: Cayley transform
describes a project that uses: mftoolbox
MaRDI profile type: Publication
full work available at URL: s10589-016-9883-4
OpenAlex ID: W2556460356
Wikidata QID: Q115384045
cites work: Q5433140
cites work: Projection-like retractions on matrix manifolds
cites work: Some global optimization problems on Stiefel manifolds
cites work: Two-Point Step Size Gradient Methods
cites work: A nonmonotone conjugate gradient algorithm for unconstrained optimization
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: Q3702408
cites work: Q4003026
cites work: The Geometry of Algorithms with Orthogonality Constraints
cites work: Q4917542
cites work: Procrustes Problems
cites work: Efficient rank reduction of correlation matrices
cites work: Functions of Matrices
cites work: A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions
cites work: A Riemannian symmetric rank-one trust-region method
cites work: Intrinsic representation of tangent vectors and vector transports on matrix manifolds
cites work: A Broyden Class of Quasi-Newton Methods for Riemannian Optimization
cites work: A framework of constraint preserving update schemes for optimization on Stiefel manifold
cites work: A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem
cites work: Limited memory block Krylov subspace optimization for computing dominant singular value decompositions
cites work: On the Analysis of the Discretized Kohn--Sham Density Functional Theory
cites work: The trace ratio optimization problem
cites work: Q5491447
cites work: Optimization methods on Riemannian manifolds and their application to shape space
cites work: Q4414854
cites work: Numerical Methods for Large Eigenvalue Problems
cites work: A Riemannian Optimization Approach to the Matrix Singular Value Decomposition
cites work: A new, globally convergent Riemannian conjugate gradient method
cites work: Adaptive regularized self-consistent field iteration with exact Hessian for electronic structure calculation
cites work: The ubiquitous Kronecker product
cites work: A feasible method for optimization with orthogonality constraints
cites work: Trace-penalty minimization for large-scale eigenspace computation
cites work: Q3632189
cites work: A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
cites work: Gradient type optimization methods for electronic structure calculations
cites work: Maximization of the sum of the trace ratio on the Stiefel manifold. I: Theory
cites work: Maximization of the sum of the trace ratio on the Stiefel manifold. II: computation
cites work: A feasible filter method for the nearest low-rank correlation matrix problem
DOI: 10.1007/S10589-016-9883-4
description: scientific article; zbMATH DE number 6754770