Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization

DOI10.1137/16M1098929zbMath1397.94021OpenAlexW2746118311MaRDI QIDQ3130749

Yifei Lou, Tian-Hui Ma, Ting-Zhu Huang

Publication date: 26 January 2018

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/16m1098929

zbMATH Keywords

matrix completionsparse recoverycompressed sensingrank minimizationdifference of convex functions algorithm\(l_{1-2}\) minimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Matrix completion problems (15A83)

Related Items

Tensor train rank minimization with hybrid smoothness regularization for visual data recovery, Low-rank matrix recovery with Ky Fan 2-\(k\)-norm, An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems, Image Segmentation via Fischer-Burmeister Total Variation and Thresholding, Low rank matrix recovery with impulsive noise, Weighted hybrid truncated norm regularization method for low-rank matrix completion, Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model, Robust signal recovery via \(\ell_{1-2}/ \ell_p\) minimization with partially known support, Sorted \(L_1/L_2\) minimization for sparse signal recovery, Huberization image restoration model from incomplete multiplicative noisy data, Compressive total variation for image reconstruction and restoration, Matrix factorization for low-rank tensor completion using framelet prior, \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery, A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems, Enhanced total variation minimization for stable image reconstruction, \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization, Total variation and high-order total variation adaptive model for restoring blurred images with Cauchy noise, Calmness of partial perturbation to composite rank constraint systems and its applications, A global exact penalty for rank-constrained optimization problem and applications, Enhancing matrix completion using a modified second-order total variation, A sheared low-rank model for oblique stripe removal, Simultaneous image enhancement and restoration with non-convex total variation, A Scale-Invariant Approach for Sparse Signal Recovery, Multi-dimensional imaging data recovery via minimizing the partial sum of tubal nuclear norm, Minimization of the difference of Nuclear and Frobenius norms for noisy low rank matrix recovery, A variational model with hybrid hyper-Laplacian priors for Retinex, Low-rank tensor completion via smooth matrix factorization, Remote sensing images destriping using unidirectional hybrid total variation and nonconvex low-rank regularization, On image restoration from random sampling noisy frequency data with regularization, ℓ ₁ − αℓ ₂ minimization methods for signal and image reconstruction with impulsive noise removal, Weighted lp − l1 minimization methods for block sparse recovery and rank minimization, New Restricted Isometry Property Analysis for $\ell_1-\ell_2$ Minimization Methods, Limited-Angle CT Reconstruction via the $L_1/L_2$ Minimization, Robust signal recovery for ℓ _1–2 minimization via prior support information, The Dantzig selector: recovery of signal via ℓ ₁ − αℓ ₂ minimization, A smoothing proximal gradient algorithm for matrix rank minimization problem

Uses Software

• PDCO
• BLOOMP
• RecPF
• EdgeCS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Nearly unbiased variable selection under minimax concave penalty
• Nonlinear total variation based noise removal algorithms
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• An alternating direction method with continuation for nonconvex low rank minimization
• Point source super-resolution via non-convex \(L_1\) based methods
• Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
• Fixed point and Bregman iterative methods for matrix rank minimization
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• The restricted isometry property and its implications for compressed sensing
• Characterization of the subdifferential of some matrix norms
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Tensor completion using total variation and low-rank matrix factorization
• The geometry of graphs and some of its algorithmic applications
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• PhaseLiftOff: an accurate and stable phase retrieval method based on difference of trace and Frobenius norms
• Atomic Decomposition by Basis Pursuit
• Pinching, Trimming, Truncating, and Averaging of Matrices
• Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
• A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
• A New Convex Optimization Model for Multiplicative Noise and Blur Removal
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• Coherence Pattern–Guided Compressive Sensing with Unresolved Grids
• Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
• A Singular Value Thresholding Algorithm for Matrix Completion
• The Split Bregman Method for L1-Regularized Problems
• A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Iteratively reweighted least squares minimization for sparse recovery
• Variational Analysis
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Edge Guided Reconstruction for Compressive Imaging
• Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
• Minimization of $\ell_{1-2}$ for Compressed Sensing
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Total Variation Structured Total Least Squares Method for Image Restoration
• Stable signal recovery from incomplete and inaccurate measurements
• Sparse Signal Reconstruction via Iterative Support Detection
• Compressed sensing