Fixed-rank matrix factorizations and Riemannian low-rank optimization
- 12 November 2013
- journal article
- research article
- Published by Springer Nature in Computational Statistics
- Vol. 29 (3-4) , 591-621
Abstract
No abstract availableKeywords
All Related Versions
This publication has 25 references indexed in Scilit:
- LU factoring of non-invertible matricesACM Communications in Computer Algebra, 2010
- Grassmann algorithms for low rank approximation of matrices with missing valuesBIT Numerical Mathematics, 2010
- Riemannian Metric and Geometric Mean for Positive Semidefinite Matrices of Fixed RankSIAM Journal on Matrix Analysis and Applications, 2010
- Supervised prediction of drug–target interactions using bipartite local modelsBioinformatics, 2009
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Prediction of drug–target interaction networks from the integration of chemical and genomic spacesBioinformatics, 2008
- Dimension Reduction and Coefficient Estimation in Multivariate Linear RegressionJournal of the Royal Statistical Society Series B: Statistical Methodology, 2007
- Fast low-rank modifications of the thin singular value decompositionLinear Algebra and its Applications, 2006
- Full Rank Factorization of MatricesMathematics Magazine, 1999
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]Communications of the ACM, 1972