Nonconvex optimization for robust tensor completion from grossly sparse observations
From MaRDI portal
Recommendations
- A generalized non-convex method for robust tensor completion
- Robust tensor recovery with nonconvex and nonsmooth regularization
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Nonconvex Low-Rank Tensor Completion from Noisy Data
- Nonlocal robust tensor recovery with nonconvex regularization
- A non-convex tensor rank approximation for tensor completion
- Nonconvex tensor rank minimization and its applications to tensor recovery
- Robust Low-Rank Tensor Recovery via Nonconvex Singular Value Minimization
- Robust Schatten-p norm based approach for tensor completion
- Robust tensor completion: equivalent surrogates, error bounds, and algorithms
Cites work
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- A TVSCAD approach for image deblurring with impulsive noise
- Adaptive correction procedure for TVL1 image deblurring under impulse noise
- Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background/foreground extraction
- Alternating direction method of multipliers with difference of convex functions
- An Adaptive Correction Approach for Tensor Completion
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- Convergence of a subgradient method for computing the bound norm of matrices
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Factorization strategies for third-order tensors
- Global convergence of ADMM in nonconvex nonsmooth optimization
- scientific article; zbMATH DE number 4041643 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Low Tucker rank tensor recovery via ADMM based on exact and inexact iteratively reweighted algorithms
- Nearly unbiased variable selection under minimax concave penalty
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Robust low-rank tensor recovery: models and algorithms
- Robust principal component analysis?
- Sparse Approximate Solutions to Linear Systems
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tensor Decompositions and Applications
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
- Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(36)- The nonconvex tensor robust principal component analysis approximation model via the weighted _p-norm regularization
- Robust tensor recovery with nonconvex and nonsmooth regularization
- Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms
- Tensor completion via fully-connected tensor network decomposition with regularized factors
- Nonlinear transform induced tensor nuclear norm for tensor completion
- Robust Schatten-p norm based approach for tensor completion
- A non-convex tensor rank approximation for tensor completion
- Optimization on the hierarchical Tucker manifold - applications to tensor completion
- Proximal gradient algorithm for nonconvex low tubal rank tensor recovery
- Near-optimal sample complexity for convex tensor completion
- Nonconvex Low-Rank Tensor Completion from Noisy Data
- Robust Low-Rank Tensor Recovery via Nonconvex Singular Value Minimization
- Nonlocal robust tensor recovery with nonconvex regularization
- Robust tensor completion: equivalent surrogates, error bounds, and algorithms
- Fully-connected tensor network decomposition for robust tensor completion problem
- Tensor completion via multi-directional partial tensor nuclear norm with total variation regularization
- A generalized non-convex method for robust tensor completion
- Nonconvex optimization for third‐order tensor completion under wavelet transform
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
- Block diagonalization of block circulant quaternion matrices and the fast calculation for T-product of quaternion tensors
- The generalized tensor decomposition with heterogeneous tensor product for third-order tensors
- A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging
- Subspace-based hyperspectral and multispectral image fusion method via minimum Frobenius norm factorization
- Frequency-aware tensor network decomposition for multi-dimensional image recovery
- Slice-wise irregular tensor decomposition and its application
- A robust tensor wheel decomposition-based regularization method for tensor completion problem
- A symmetric ADMM-type algorithm for robust tensor completion problems using a regularized SCAD-Schatten-p model with application in color image and video recovery
- Subspace-based coupled tensor decomposition for hyperspectral blind fusion
- Convergence of three-block ADMM for weakly convex optimization problems
- A fast correction approach to tensor robust principal component analysis
- Poisson tensor completion via nonconvex regularization and nonlocal self-similarity for multi-dimensional image recovery
- The rank-1 completion problem for cubic tensors
- Extremal geometric measure of entanglement and Riemannian optimization methods
- Robust completion for rank-1 tensors with noises
- A coarse-to-fine hybrid registration and fusion framework for hyperspectral superresolution via batch image alignment
- Accelerated FCTN with perturbed periodic second-order discrete difference regularization for tensor completion
This page was built for publication: Nonconvex optimization for robust tensor completion from grossly sparse observations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2219800)
