Transportless conjugate gradient for optimization on Stiefel manifold
From MaRDI portal
Publication:2185047
DOI10.1007/s40314-020-01184-wzbMath1449.65117OpenAlexW3030077668MaRDI QIDQ2185047
Edgar Fuentes Figueroa, Oscar Dalmau
Publication date: 4 June 2020
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-020-01184-w
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Programming in abstract spaces (90C48) Calculus on manifolds; nonlinear operators (58C99)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- 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
- Efficient rank reduction of correlation matrices
- Conjugate gradient algorithm for optimization under unitary matrix constraint
- Some global optimization problems on Stiefel manifolds
- A Procrustes problem on the Stiefel manifold
- A Riemannian conjugate gradient method for optimization on the Stiefel manifold
- Trust-region methods on Riemannian manifolds
- Trace-penalty minimization for large-scale eigenspace computation
- A generalized solution of the orthogonal Procrustes problem
- Optimization Methods on Riemannian Manifolds and Their Application to Shape Space
- A Broyden Class of Quasi-Newton Methods for Riemannian Optimization
- KSSOLV—a MATLAB toolbox for solving the Kohn-Sham equations
- A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem
- A Trust Region Direct Constrained Minimization Algorithm for the Kohn–Sham Equation
- An implicit trust-region method on Riemannian manifolds
- Procrustes Problems
- Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
- Rank reduction of correlation matrices by majorization
- Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
- A new, globally convergent Riemannian conjugate gradient method
- Optimization algorithms exploiting unitary constraints
- On the Analysis of the Discretized Kohn--Sham Density Functional Theory
This page was built for publication: Transportless conjugate gradient for optimization on Stiefel manifold