A Riemannian conjugate gradient method for optimization on the Stiefel manifold
From MaRDI portal
Publication:2012231
DOI10.1007/s10589-016-9883-4zbMath1401.90230OpenAlexW2556460356WikidataQ115384045 ScholiaQ115384045MaRDI QIDQ2012231
Publication date: 28 July 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-016-9883-4
Stiefel manifoldconjugate gradient methodretractionCayley transformRiemannian optimizationvector transport
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Manifolds and measure-geometric topics (49Q99)
Related Items
Riemannian Conjugate Gradient Methods: General Framework and Specific Algorithms with Convergence Analyses, HSH-norm optimal MOR for the MIMO linear time-invariant systems on the Stiefel manifold, Stochastic consensus dynamics for nonconvex optimization on the Stiefel manifold: Mean-field limit and convergence, A new family of hybrid three-term conjugate gradient methods with applications in image restoration, Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors, A Riemannian optimization approach for solving the generalized eigenvalue problem for nonsquare matrix pencils, An efficient damped Newton-type algorithm with globalization strategy on Riemannian manifolds, Implicit steepest descent algorithm for optimization with orthogonality constraints, Transportless conjugate gradient for optimization on Stiefel manifold, A limited-memory Riemannian symmetric rank-one trust-region method with a restart strategy, Unsupervised learning of disentangled representations in deep restricted kernel machines with orthogonality constraints, A communication-efficient and privacy-aware distributed algorithm for sparse PCA, Faster Riemannian Newton-type optimization by subsampling and cubic regularization, Scaled fixed point algorithm for computing the matrix square root, Effective algorithms for solving trace minimization problem in multivariate statistics, Slow and finite-time relaxations to \(m\)-bipartite consensus on the Stiefel manifold, Generalized left-localized Cayley parametrization for optimization with orthogonality constraints, A Riemannian BFGS Method Without Differentiated Retraction for Nonconvex Optimization Problems, AN EFFICIENT METHOD FOR SOLVING A CLASS OF MATRIX TRACE FUNCTION MINIMIZATION PROBLEM IN MULTIVARIATE STATISTICAL, A hybrid Riemannian conjugate gradient method for nonconvex optimization problems, A brief introduction to manifold optimization, A Riemannian derivative-free Polak-Ribiére-Polyak method for tangent vector field, Cayley-transform-based gradient and conjugate gradient algorithms on Grassmann manifolds, First Order Methods for Optimization on Riemannian Manifolds, Solving the discrete Euler-Arnold equations for the generalized rigid body motion, High-Order Retractions on Matrix Manifolds Using Projected Polynomials, Newton's method for the parameterized generalized eigenvalue problem with nonsquare matrix pencils, Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization, Sufficient descent Riemannian conjugate gradient methods, Spectral residual method for nonlinear equations on Riemannian manifolds, On matrix exponentials and their approximations related to optimization on the Stiefel manifold, Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold, Global convergence of Riemannian line search methods with a Zhang-Hager-type condition, H2 optimal model order reduction on the Stiefel manifold for the MIMO discrete system by the cross Gramian, Riemannian optimization with a preconditioning scheme on the generalized Stiefel manifold
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 feasible filter method for the nearest low-rank correlation matrix problem
- Intrinsic representation of tangent vectors and vector transports on matrix manifolds
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Efficient rank reduction of correlation matrices
- Maximization of the sum of the trace ratio on the Stiefel manifold. II: computation
- The ubiquitous Kronecker product
- Some global optimization problems on Stiefel manifolds
- Maximization of the sum of the trace ratio on the Stiefel manifold. I: Theory
- A Riemannian symmetric rank-one trust-region method
- Trace-penalty minimization for large-scale eigenspace computation
- Adaptive Regularized Self-Consistent Field Iteration with Exact Hessian for Electronic Structure Calculation
- Limited Memory Block Krylov Subspace Optimization for Computing Dominant Singular Value Decompositions
- Gradient Type Optimization Methods For Electronic Structure Calculations
- Projection-like Retractions on Matrix Manifolds
- Optimization Methods on Riemannian Manifolds and Their Application to Shape Space
- The Trace Ratio Optimization Problem
- A Broyden Class of Quasi-Newton Methods for Riemannian Optimization
- Numerical Methods for Large Eigenvalue Problems
- A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem
- Two-Point Step Size Gradient Methods
- The Geometry of Algorithms with Orthogonality Constraints
- Procrustes Problems
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A new, globally convergent Riemannian conjugate gradient method
- A Riemannian Optimization Approach to the Matrix Singular Value Decomposition
- Functions of Matrices
- On the Analysis of the Discretized Kohn--Sham Density Functional Theory