A Riemannian conjugate gradient method for optimization on the Stiefel manifold
From MaRDI portal
Publication:2012231
DOI10.1007/S10589-016-9883-4zbMATH Open1401.90230OpenAlexW2556460356WikidataQ115384045 ScholiaQ115384045MaRDI QIDQ2012231FDOQ2012231
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
Recommendations
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)
Cites Work
- A feasible method for optimization with orthogonality constraints
- Functions of Matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Geometry of Algorithms with Orthogonality Constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two-Point Step Size Gradient Methods
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Efficient rank reduction of correlation matrices
- The ubiquitous Kronecker product
- Title not available (Why is that?)
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Procrustes Problems
- Numerical Methods for Large Eigenvalue Problems
- Title not available (Why is that?)
- A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions
- Optimization methods on Riemannian manifolds and their application to shape space
- A new, globally convergent Riemannian conjugate gradient method
- A Riemannian symmetric rank-one trust-region method
- A Broyden Class of Quasi-Newton Methods for Riemannian Optimization
- A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Limited memory block Krylov subspace optimization for computing dominant singular value decompositions
- Projection-like retractions on matrix manifolds
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- A Riemannian Optimization Approach to the Matrix Singular Value Decomposition
- Some global optimization problems on Stiefel manifolds
- The trace ratio optimization problem
- A feasible filter method for the nearest low-rank correlation matrix problem
- Intrinsic representation of tangent vectors and vector transports on matrix manifolds
- Subspace techniques for nonlinear optimization
- Adaptive regularized self-consistent field iteration with exact Hessian for electronic structure calculation
- Maximization of the sum of the trace ratio on the Stiefel manifold. I: Theory
- Gradient type optimization methods for electronic structure calculations
- Maximization of the sum of the trace ratio on the Stiefel manifold. II: computation
- Trace-penalty minimization for large-scale eigenspace computation
- On the Analysis of the Discretized Kohn--Sham Density Functional Theory
Cited In (53)
- Riemannian Optimization on the Symplectic Stiefel Manifold
- Riemannian gradient algorithm for the numerical solution of Stein equations
- Stochastic consensus dynamics for nonconvex optimization on the Stiefel manifold: Mean-field limit and convergence
- Riemannian quantum circuit optimization for Hamiltonian simulation
- Sufficient descent Riemannian conjugate gradient methods
- A new family of hybrid three-term conjugate gradient methods with applications in image restoration
- Riemannian Conjugate Gradient Methods: General Framework and Specific Algorithms with Convergence Analyses
- Title not available (Why is that?)
- Scaled fixed point algorithm for computing the matrix square root
- Cayley-transform-based gradient and conjugate gradient algorithms on Grassmann manifolds
- A communication-efficient and privacy-aware distributed algorithm for sparse PCA
- New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
- Numerical approaches for constrained and unconstrained, static optimization on the special Euclidean group \(\mathsf{SE}(3)\)
- Newton's method for the parameterized generalized eigenvalue problem with nonsquare matrix pencils
- Proximal quasi-Newton method for composite optimization over the Stiefel manifold
- First Order Methods for Optimization on Riemannian Manifolds
- A matrix-free implementation of Riemannian Newton's method on the Stiefel manifold
- Riemannian optimization methods for the truncated Takagi factorization
- Solving the discrete Euler-Arnold equations for the generalized rigid body motion
- Slow and finite-time relaxations to \(m\)-bipartite consensus on the Stiefel manifold
- A brief introduction to manifold optimization
- Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold
- AN EFFICIENT METHOD FOR SOLVING A CLASS OF MATRIX TRACE FUNCTION MINIMIZATION PROBLEM IN MULTIVARIATE STATISTICAL
- A limited-memory Riemannian symmetric rank-one trust-region method with a restart strategy
- On matrix exponentials and their approximations related to optimization on the Stiefel manifold
- Effective algorithms for solving trace minimization problem in multivariate statistics
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- A Riemannian derivative-free Polak-Ribiére-Polyak method for tangent vector field
- Spectral residual method for nonlinear equations on Riemannian manifolds
- Convergence Analysis of Gradient Algorithms on Riemannian Manifolds without Curvature Constraints and Application to Riemannian Mass
- Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors
- Generalized left-localized Cayley parametrization for optimization with orthogonality constraints
- Unsupervised learning of disentangled representations in deep restricted kernel machines with orthogonality constraints
- High-Order Retractions on Matrix Manifolds Using Projected Polynomials
- Globally convergent optimization algorithms on Riemannian manifolds: Uniform framework for unconstrained and constrained optimization
- An efficient damped Newton-type algorithm with globalization strategy on Riemannian manifolds
- Implicit steepest descent algorithm for optimization with orthogonality constraints
- A hybrid Riemannian conjugate gradient method for nonconvex optimization problems
- Title not available (Why is that?)
- H2 optimal model order reduction on the Stiefel manifold for the MIMO discrete system by the cross Gramian
- A Riemannian optimization approach for solving the generalized eigenvalue problem for nonsquare matrix pencils
- Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization
- HSH-norm optimal MOR for the MIMO linear time-invariant systems on the Stiefel manifold
- Riemannian optimization with a preconditioning scheme on the generalized Stiefel manifold
- Transportless conjugate gradient for optimization on Stiefel manifold
- A Riemannian BFGS Method Without Differentiated Retraction for Nonconvex Optimization Problems
- Practical gradient and conjugate gradient methods on flag manifolds
- Global convergence of Riemannian line search methods with a Zhang-Hager-type condition
- Faster Riemannian Newton-type optimization by subsampling and cubic regularization
- Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds
- A trust-region method for solving truncated complex singular value decomposition
- An efficient algorithm for solving a class of matrix optimization problem in scalable probabilistic approximation
- A Riemannian conjugate gradient approach for solving the generalized eigenvalue problem with minimal perturbation
Uses Software
This page was built for publication: A Riemannian conjugate gradient method for optimization on the Stiefel manifold
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012231)
