Tensor Algebra and Multidimensional Harmonic Retrieval in Signal Processing for MIMO Radar
From MaRDI portal
Publication:4570633
Cited in
(12)- New Uniqueness Conditions for the Canonical Polyadic Decomposition of Third-Order Tensors
- Non-convex projected gradient descent for generalized low-rank tensor regression
- Computing dense tensor decompositions with optimal dimension trees
- On polynomial time methods for exact low-rank tensor completion
- Convenient tail bounds for sums of random tensors
- General tail bounds for random tensors summation: majorization approach
- Statistically optimal and computationally efficient low rank tensor completion from noisy entries
- Completely positive tensor recovery with minimal nuclear value
- Accurate and Computationally Efficient Tensor-Based Subspace Approach for Multidimensional Harmonic Retrieval
- On tensor completion via nuclear norm minimization
- Tensor-based angle and range estimation method in monostatic FDA-MIMO radar
- Exact line and plane search for tensor optimization
This page was built for publication: Tensor Algebra and Multidimensional Harmonic Retrieval in Signal Processing for MIMO Radar
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4570633)