Restricted isometry properties and nonconvex compressive sensing

DOI10.1088/0266-5611/24/3/035020zbMath1143.94004OpenAlexW2025666718MaRDI QIDQ3507945

Publication date: 24 June 2008

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a3aa36919ba22867189e37294dc614a1abddabcf

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

Smoothing neural network for $L_0$ regularized optimization problem with general convex constraints, Block sparse signal recovery via minimizing the block $q$-ratio sparsity, The sampling complexity on nonconvex sparse phase retrieval problem, A unified analysis of convex and non-convex $\ell_p$-ball projection problems, Sparse and risk diversification portfolio selection, $\boldsymbol{L_1-\beta L_q}$ Minimization for Signal and Image Recovery, Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization, Nonconvex $\ell_p-\alpha\ell_q$ minimization method and $p$-RIP condition for stable recovery of approximately $k$-sparse signals, A reduced half thresholding algorithm, Unnamed Item, Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection, Sufficient conditions on stable reconstruction of weighted problem, $S_{1/2}$ regularization methods and fixed point algorithms for affine rank minimization problems, Nonlinear residual minimization by iteratively reweighted least squares, Stable recovery of low-rank matrix via nonconvex Schatten $p$-minimization, A smoothing SQP framework for a class of composite $L_q$ minimization over polyhedron, An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization, Linearly Constrained Non-Lipschitz Optimization for Image Restoration, Optimality conditions for the constrainedL_p-regularization, Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm, Conjugate gradient acceleration of iteratively re-weighted least squares methods, A smoothing majorization method for matrix minimization, Sparse phase retrieval via ℓp (0 < p ≤ 1) minimization, Quantization and Compressive Sensing, The non-convex sparse problem with nonnegative constraint for signal reconstruction, Sparse signal recovery via non-convex optimization and overcomplete dictionaries, The springback penalty for robust signal recovery, Sparse SAR imaging based on $L_{1/2}$ regularization, The sparsity of underdetermined linear system via $l_p$ minimization for $0 < p < 1$, The bounds of restricted isometry constants for low rank matrices recovery, Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing, The Gelfand widths of $\ell_p$-balls for $0 < p \leq 1$, Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems, Solving nonsmooth and discontinuous optimal power flow problems via interior-point $\ell_p$-penalty approach, The equivalence of three types of error bounds for weakly and approximately convex functions, An improved algorithm for the $L_2-L_p$ minimization problem, Recovery of low-rank matrices based on the rank null space properties, The null space property of the weighted ℓr − ℓ1 minimization, A generalized elastic net regularization with smoothed $\ell _{q}$ penalty for sparse vector recovery, $L_2$-$L_q$ reconstruction model for computational spectrometer, Recovery of sparsest signals via $\ell^q $-minimization, Stability of lq-analysis based dual frame with Weibull matrices for 0 < q ≤ 1, An interior-point $\ell_{\frac{1}{2}}$-penalty method for inequality constrained nonlinear optimization, $\ell _p$ regularized low-rank approximation via iterative reweighted singular value minimization, Affine matrix rank minimization problem via non-convex fraction function penalty, A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems, A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery, Complexity of unconstrained $L_2 - L_p$ minimization, Perturbations of measurement matrices and dictionaries in compressed sensing, Restricted $p$-isometry properties of partially sparse signal recovery, An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration, Bound alternative direction optimization for image deblurring, TV+TV regularization with nonconvex sparseness-inducing penalty for image restoration, Iterative reweighted minimization methods for $l_p$ regularized unconstrained nonlinear programming, Concentration of $S$-largest mutilated vectors with $\ell_p$-quasinorm for $0<p\leq 1$ and its applications, Signal separation under coherent dictionaries and $\ell_p$-bounded noise, Compressed sensing with coherent tight frames via $l_q$-minimization for $0 < q \leq 1$, On monotone and primal-dual active set schemes for $\ell^p$-type problems, $p \in (0,1$], Recovery analysis for weighted mixed $\ell_2 / \ell_p$ minimization with $0 < p \leq 1$, Perfect reconstruction of sparse signals with piecewise continuous nonconvex penalties and nonconvexity control, Sparse signal recovery with prior information by iterative reweighted least squares algorithm, Sparse recovery in probability via $l_q$-minimization with Weibull random matrices for $0 < q\leq 1$, A modified greedy analysis pursuit algorithm for the cosparse analysis model, GAITA: a Gauss-Seidel iterative thresholding algorithm for $\ell_q$ regularized least squares regression, An L0-regularized global anisotropic gradient prior for single-image de-raining, The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty, A reweighted nuclear norm minimization algorithm for low rank matrix recovery, The null space property for sparse recovery from multiple measurement vectors, Restricted $p$-isometry property and its application for nonconvex compressive sensing, A Discretized Newton Flow for Time-Varying Linear Inverse Problems, Robust PCA and subspace tracking from incomplete observations using $\ell _0$-surrogates, Iterative reweighted noninteger norm regularizing SVM for gene expression data classification, Improved bounds for restricted isometry constants, Sparse recovery by non-convex optimization - instance optimality, Iterative re-weighted least squares algorithm for $l_p$-minimization with tight frame and $0 < p \leq 1$, Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems, On a monotone scheme for nonconvex nonsmooth optimization with applications to fracture mechanics, Recovery of seismic wavefields by an $l_{q}$-norm constrained regularization method, Capped $\ell_p$ approximations for the composite $\ell_0$ regularization problem, New regularization method and iteratively reweighted algorithm for sparse vector recovery, A unified primal dual active set algorithm for nonconvex sparse recovery, On sparse beamformer design with reverberation, Convergence of the reweighted $\ell_1$ minimization algorithm for $\ell_2-\ell_p$ minimization, A constrained optimization reformulation and a feasible descent direction method for $L_{1/2}$ regularization, Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms, Model selection for hybrid dynamical systems via sparse regression, A ``nonconvex+nonconvex approach for image restoration with impulse noise removal, Accelerated iterative hard thresholding algorithm for $l_0$ regularized regression problem, An adaptive algorithm for TV-based model of three norms $L_q$ $(q = \frac{1}{2}, 1, 2)$ in image restoration, A simple Gaussian measurement bound for exact recovery of block-sparse signals, Truncated sparse approximation property and truncated $q$-norm minimization, Iteratively reweighted least squares minimization for sparse recovery, Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model, EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION, A novel adaptive wide-angle SAR imaging algorithm based on Boltzmann machine model, The probabilistic estimates on the largest and smallest $q$-singular values of random matrices, One-bit compressed sensing via ℓ _p(0 < p < 1)-minimization method, ℓ ₁ − αℓ ₂ minimization methods for signal and image reconstruction with impulsive noise removal, Optimal RIP bounds for sparse signals recovery via $\ell_p$ minimization, Minimization of $\ell_{1-2}$ for Compressed Sensing, Weighted lp − l1 minimization methods for block sparse recovery and rank minimization, New Restricted Isometry Property Analysis for $\ell_1-\ell_2$ Minimization Methods, The Dantzig selector: recovery of signal via ℓ ₁ − αℓ ₂ minimization, Stable recovery of low rank matrices from nuclear norm minimization, First- and second-order necessary conditions via exact penalty functions, Stable recovery of sparse signals with coherent tight frames via lp-analysis approach, Entropy function-based algorithms for solving a class of nonconvex minimization problems, Sparse PSD approximation of the PSD cone, Low rank matrix recovery with adversarial sparse noise*