On $l_q$ Optimization and Matrix Completion
From MaRDI portal
Publication:4574106
DOI10.1109/TSP.2012.2212015zbMath1393.94353OpenAlexW1966661320MaRDI QIDQ4574106
Publication date: 18 July 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsp.2012.2212015
Related Items (28)
Sparse signal recovery by accelerated ℓq (0<q<1) thresholding algorithm ⋮ Robust low transformed multi-rank tensor methods for image alignment ⋮ GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery ⋮ A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery ⋮ A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery ⋮ Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions ⋮ A unified analysis of convex and non-convex \(\ell_p\)-ball projection problems ⋮ Support Recovery and Parameter Identification of Multivariate ARMA Systems with Exogenous Inputs ⋮ Tensor factorization via transformed tensor-tensor product for image alignment ⋮ Accelerated matrix completion algorithm using continuation strategy and randomized SVD ⋮ A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems ⋮ Group sparse recovery in impulsive noise via alternating direction method of multipliers ⋮ Tensor Robust Principal Component Analysis via Tensor Fibered Rank and \({\boldsymbol{{l_p}}}\) Minimization ⋮ A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery ⋮ Enhancing matrix completion using a modified second-order total variation ⋮ Unnamed Item ⋮ Sparse system identification for stochastic systems with general observation sequences ⋮ Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery ⋮ Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers ⋮ Sparse parameter identification of stochastic dynamical systems ⋮ Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries ⋮ ℓ 1 − αℓ 2 minimization methods for signal and image reconstruction with impulsive noise removal ⋮ Nonlocal robust tensor recovery with nonconvex regularization * ⋮ Robust sparse principal component analysis ⋮ Convergence properties of monotone and nonmonotone proximal gradient methods revisited ⋮ Unnamed Item ⋮ The Dantzig selector: recovery of signal via ℓ 1 − αℓ 2 minimization ⋮ Bilevel Optimization of Regularization Hyperparameters in Machine Learning
This page was built for publication: On $l_q$ Optimization and Matrix Completion