Approximate low-rank factorization with structured factors
From MaRDI portal
Publication:2445796
Recommendations
- Low-rank approximations with sparse factors. I: Basic algorithms and error analysis
- An alternating minimization algorithm for factor analysis.
- Structured low rank approximation of non-negative matrices
- Factorization approach to structured low-rank approximation with applications
- Structured low rank approximation
Cites work
- Block-Toeplitz/Hankel Structured Total Least Squares
- Convergence of the sequence of parameters generated by alternating least squares algorithms
- Learning the parts of objects by non-negative matrix factorization
- Left vs, right representations for solving weighted low-rank approximation problems
- Separable nonlinear least squares: the variable projection method and its applications
- Setting up alternating least squares and iterative majorization algorithms for solving various matrix optimization problems
- The element-wise weighted total least-squares problem
Cited in
(8)- A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data
- 3rd special issue on matrix computations and statistics
- A combinatorial approach to \(L_1\)-matrix factorization
- scientific article; zbMATH DE number 440639 (Why is no real title available?)
- Structural Identifiability in Low-Rank Matrix Factorization
- Low-Rank Approximations with Sparse Factors II: Penalized Methods with Discrete Newton-Like Iterations
- Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
- Structural identifiability in low-rank matrix factorization
This page was built for publication: Approximate low-rank factorization with structured factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2445796)
