An inexact continuation accelerated proximal gradient algorithm for low \textit{n}-rank tensor recovery
DOI10.1080/00207160.2013.854881zbMATH Open1302.90151OpenAlexW1999750181MaRDI QIDQ2935378FDOQ2935378
Authors: Huihui Liu, Zhan-Jie Song 
Publication date: 29 December 2014
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2013.854881
Recommendations
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Proximal gradient algorithm for nonconvex low tubal rank tensor recovery
- Minimum \( n\)-rank approximation via iterative hard thresholding
- A splitting augmented Lagrangian method for low multilinear-rank tensor recovery
- Low Tucker rank tensor recovery via ADMM based on exact and inexact iteratively reweighted algorithms
nuclear normsingular value decompositiontensor completionproximal gradientlow \textit{n}-rank tensor
Numerical mathematical programming methods (65K05) Convex programming (90C25) Control/observation systems with incomplete information (93C41)
Cites Work
- Convergence of a block coordinate descent method for nondifferentiable minimization
- A Singular Value Thresholding Algorithm for Matrix Completion
- Tensor Decompositions and Applications
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Compressed sensing
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Sparse Approximate Solutions to Linear Systems
- Nonlinear Programming
- Tensor rank is NP-complete
- A numerical algorithm for image sequence inpainting that preserves fine textures
Cited In (8)
- Fast randomized tensor singular value thresholding for low‐rank tensor optimization
- An accelerated proximal gradient algorithm for Hankel tensor completion
- Minimum \( n\)-rank approximation via iterative hard thresholding
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Low Tucker rank tensor recovery via ADMM based on exact and inexact iteratively reweighted algorithms
- Conditions for the equivalence between the low-\(n\)-rank tensor recovery problem and its convex relaxation
- A splitting augmented Lagrangian method for low multilinear-rank tensor recovery
- Proximal gradient algorithm for nonconvex low tubal rank tensor recovery
This page was built for publication: An inexact continuation accelerated proximal gradient algorithm for low \textit{n}-rank tensor recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2935378)
