Low-rank approximation. Algorithms, implementation, applications
From MaRDI portal
Publication:1795645
DOI10.1007/978-3-319-89620-5zbMath1397.90007OpenAlexW4246706978MaRDI QIDQ1795645
Publication date: 16 October 2018
Published in: Communications and Control Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-89620-5
Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) General theory of mathematical modeling (00A71)
Related Items (14)
Relaxed NewtonSLRA for approximate GCD ⋮ Exact solutions in low-rank approximation with zeros ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ Structured low-rank approximation for nonlinear matrices ⋮ Fast Estimation of Approximate Matrix Ranks Using Spectral Densities ⋮ A Hybrid Penalty Method for a Class of Optimization Problems with Multiple Rank Constraints ⋮ On the comparison of LES data-driven reduced order approaches for hydroacoustic analysis ⋮ Accurate and fast matrix factorization for low-rank learning. ⋮ Optimal approximation with exponential sums by a maximum likelihood modification of Prony's method ⋮ On the behavior of autonomous Wiener systems ⋮ Modifications of Prony's method for the recovery and sparse approximation with generalized exponential sums ⋮ Blind deconvolution of covariance matrix inverses for autoregressive processes ⋮ A Convex Approach to Superresolution and Regularization of Lines in Images ⋮ A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix
Uses Software
This page was built for publication: Low-rank approximation. Algorithms, implementation, applications
