Search for sparse solutions of super-large systems with a tensor structure
From MaRDI portal
Publication:2101411
DOI10.1134/S0965542522110136zbMath1506.94014OpenAlexW4310689789MaRDI QIDQ2101411
Sergey Morozov, Dmitry A. Zheltkov, Nikolai L. Zamarashkin
Publication date: 6 December 2022
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542522110136
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Linear equations (linear algebraic aspects) (15A06)
Cites Work
- Optimization by Simulated Annealing
- Tensor conjugate-gradient-type method for Rayleigh quotient minimization in block QTT-format
- Global Optimization Algorithms Using Tensor Trains
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Sparse and Redundant Representations
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Matching pursuits with time-frequency dictionaries
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- A method for the solution of certain non-linear problems in least squares
This page was built for publication: Search for sparse solutions of super-large systems with a tensor structure
