Matrix completion for matrices with low-rank displacement
DOI10.1553/etna_vol53s481zbMath1448.65037OpenAlexW3043164765MaRDI QIDQ2203383
Serena Morigi, Damiana Lazzaro
Publication date: 6 October 2020
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: http://etna.mcs.kent.edu/volumes/2011-2020/vol53/abstract.php?vol=53&pages=481-499
Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical optimization and variational techniques (65K10) Inverse problems in linear algebra (15A29) Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex image denoising via non-convex regularization with parameter selection
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Displacement ranks of matrices and linear equations
- Deconvolution and regularization with Toeplitz matrices
- Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function
- Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion
- Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm
- A mean value algorithm for Toeplitz matrix completion
- Exact matrix completion via convex optimization
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- A nonconvex approach to low-rank matrix completion using convex optimization
- Robust Spectral Compressed Sensing via Structured Matrix Completion
- OptShrink: An Algorithm for Improved Low-Rank Signal Matrix Denoising by Optimal, Data-Driven Singular Value Shrinkage
- A Singular Value Thresholding Algorithm for Matrix Completion
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition
- Sparse Signal Estimation by Maximally Sparse Convex Optimization
- Displacement Structure: Theory and Applications
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- An Iterative $L_{1}$-Based Image Restoration Algorithm With an Adaptive Parameter Estimation
- On a class of matrices with low displacement rank
This page was built for publication: Matrix completion for matrices with low-rank displacement
