Factorization approach to structured low-rank approximation with applications
From MaRDI portal
Publication:2936593
Abstract: We consider the problem of approximating an affinely structured matrix, for example a Hankel matrix, by a low-rank matrix with the same structure. This problem occurs in system identification, signal processing and computer algebra, among others. We impose the low-rank by modeling the approximation as a product of two factors with reduced dimension. The structure of the low-rank model is enforced by introducing a penalty term in the objective function. The proposed local optimization algorithm is able to solve the weighted structured low-rank approximation problem, as well as to deal with the cases of missing or fixed elements. In contrast to approaches based on kernel representations (in linear algebraic sense), the proposed algorithm is designed to address the case of small targeted rank. We compare it to existing approaches on numerical examples of system identification, approximate greatest common divisor problem, and symmetric tensor decomposition and demonstrate its consistently good performance.
Recommendations
Cited in
(30)- Rank-deficient spectral factorization and wavelets completion problem
- New Characterization of the Factor Refinement Algorithm with Applications
- Optimal rank-1 Hankel approximation of matrices: Frobenius norm and spectral norm and Cadzow's algorithm
- Structured low-rank approximation: optimization on matrix manifold approach
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Structural identifiability in low-rank matrix factorization
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach
- A quadratically convergent algorithm for structured low-rank approximation
- Best Low-rank Approximations and Kolmogorov $n$-widths
- Variable projection methods for approximate (greatest) common divisor computations
- Nonlinearly structured low-rank approximation
- Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
- Structured low-rank approximation and its applications
- Structured Matrix Approximations via Tensor Decompositions
- Pivoting strategy for rank-one modification of \(LDM^ t\)-like factorization
- A combinatorial approach to \(L_1\)-matrix factorization
- Novel alternating update method for low rank approximation of structured matrices
- Structural Identifiability in Low-Rank Matrix Factorization
- Variable projection for affinely structured low-rank approximation in weighted \(2\)-norms
- Structured weighted low rank approximation
- Implementation improvements and extensions of an ODE-based algorithm for structured low-rank approximation
- Approximate low-rank factorization with structured factors
- A gradient system approach for Hankel structured low-rank approximation
- Fixed-point algorithms for frequency estimation and structured low rank approximation
- A hybrid penalty method for a class of optimization problems with multiple rank constraints
- Fast separable factorization and applications
- Software for weighted structured low-rank approximation
- Structured low-rank approximation with missing data
- Optimal approximation with exponential sums by a maximum likelihood modification of Prony's method
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
This page was built for publication: Factorization approach to structured low-rank approximation with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936593)
