Sparsest solutions of underdetermined linear systems via $ \ell _q$-minimization for \(0

DOI10.1016/j.acha.2008.09.001zbMath1171.90014OpenAlexW2012961725MaRDI QIDQ1012556

Publication date: 21 April 2009

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.acha.2008.09.001

zbMATH Keywords

optimization linear systems inverse problems norms underdeterminedness

Mathematics Subject Classification ID

Nonlinear programming (90C30) Inverse theorems in approximation theory (41A27)

Related Items

Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method, Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery, Sufficient conditions on stable reconstruction of weighted problem, A General Non-Lipschitz Infimal Convolution Regularized Model: Lower Bound Theory and Algorithm, Stable recovery of low-rank matrix via nonconvex Schatten $p$-minimization, THE RESTRICTED ISOMETRY PROPERTY FOR SIGNAL RECOVERY WITH COHERENT TIGHT FRAMES, A Survey of Compressed Sensing, Sparse signal recovery via non-convex optimization and overcomplete dictionaries, A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem, Sparsest representations and approximations of an underdetermined linear system, On the Schatten $p$-quasi-norm minimization for low-rank matrix recovery, A proximal algorithm with backtracked extrapolation for a class of structured fractional programming, A necessary and sufficient condition for sparse vector recovery via $\ell_1-\ell_2$ minimization, Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing, Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems, The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials, Recovery analysis for block ℓp − ℓ1 minimization with prior support information, RNLp: mixing nonlocal and TV-Lp methods to remove impulse noise from images, Nonconvex mixed TV/Cahn-Hilliard functional for super-resolution/segmentation of 3D trabecular bone images, Recovery of low-rank matrices based on the rank null space properties, The null space property of the weighted ℓr − ℓ1 minimization, Heuristics for Finding Sparse Solutions of Linear Inequalities, Block sparse signal recovery via minimizing the block $q$-ratio sparsity, A refined convergence analysis of $\mathrm{pDCA}_{e}$ with applications to simultaneous sparse recovery and outlier detection, Iteratively reweighted $\ell _1$ algorithms with extrapolation, Sparse reconstruction via the mixture optimization model with iterative support estimate, Sparse signal reconstruction via collaborative neurodynamic optimization, Neural network for a class of sparse optimization with $L_0$-regularization, Smoothing inertial neurodynamic approach for sparse signal reconstruction via $L_p$-norm minimization, The sampling complexity on nonconvex sparse phase retrieval problem, A wonderful triangle in compressed sensing, Stability of lq-analysis based dual frame with Weibull matrices for 0 < q ≤ 1, Unnamed Item, A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems, A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization, Enhanced total variation minimization for stable image reconstruction, An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems, $k$-sparse vector recovery via truncated $\ell_1 -\ell_2$ local minimization, Weighted ${\ell}_{{1}}$-minimization for sparse recovery under arbitrary prior information, A null-space-based weightedl₁minimization approach to compressed sensing, Compressive Sensing, Complexity of unconstrained $L_2 - L_p$ minimization, Stability and robustness of $\ell_1$-minimizations with Weibull matrices and redundant dictionaries, Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices, Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets, Concentration of $S$-largest mutilated vectors with $\ell_p$-quasinorm for $0<p\leq 1$ and its applications, Integral representations of shallow neural network with Rectified Power Unit activation function, Evaluation of generalized degrees of freedom for sparse estimation by replica method, A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal, The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty, Least Sparsity of $p$-Norm Based Optimization Problems with $p>1$, Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere, Compressed sensing, Necessary and sufficient conditions for linear convergence of ℓ1-regularization, Recovery of Low Rank Symmetric Matrices via Schatten p Norm Minimization, Nonconvex sorted $\ell_1$ minimization for sparse approximation, Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems, DC Approximation Approach for ℓ0-minimization in Compressed Sensing, An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems, Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms, Weak Stability of ℓ₁-Minimization Methods in Sparse Data Reconstruction, Sparse recovery from extreme eigenvalues deviation inequalities, An ℓ<sub>q</sub>- Seminorm Variational Model for Impulse Noise Reduction, Non-Lipschitz Models for Image Restoration with Impulse Noise Removal, Fast Implementation of ℓ 1-Greedy Algorithm, Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model, EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION, The probabilistic estimates on the largest and smallest $q$-singular values of random matrices, On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms, Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit, Minimization of $\ell_{1-2}$ for Compressed Sensing, A non-convex algorithm framework based on DC programming and DCA for matrix completion, Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions, A New Computational Method for the Sparsest Solutions to Systems of Linear Equations, A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization, Error analysis of reweighted $l_1$ greedy algorithm for noisy reconstruction, An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model ^*, Sparse Solutions of a Class of Constrained Optimization Problems, On the Kähler form of complex $L^{p}$ space and its Lagrangian subspaces, Optimal $D$-RIP bounds in compressed sensing, Rank-one and sparse matrix decomposition for dynamic MRI, Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations, Sparse data-driven quadrature rules via $\ell^p$-quasi-norm minimization, A smoothing SQP framework for a class of composite $L_q$ minimization over polyhedron, The non-convex sparse problem with nonnegative constraint for signal reconstruction, Global optimality condition and fixed point continuation algorithm for non-Lipschitz $\ell_p$ regularized matrix minimization, Image denoising by generalized total variation regularization and least squares fidelity, A joint matrix minimization approach for multi-image face recognition, Reweighted $\ell_1$ minimization method for stochastic elliptic differential equations, Block sparse recovery via mixed $l_2/l_1$ minimization, The springback penalty for robust signal recovery, Influence factors of sparse microwave imaging radar system performance: approaches to waveform design and platform motion analysis, 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, A globally convergent algorithm for a constrained non-Lipschitz image restoration model, Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression, The Gelfand widths of $\ell_p$-balls for $0 < p \leq 1$, An improved algorithm for the $L_2-L_p$ minimization problem, A smoothing neural network for minimization $l_1$-$l_p$ in sparse signal reconstruction with measurement noises, Analysis of the equivalence relationship between $l_{0}$-minimization and $l_{p}$-minimization, Sparse signal reconstruction via the approximations of $\ell_0$ quasinorm, A smoothing method for sparse optimization over convex sets, Recovery of sparsest signals via $\ell^q $-minimization, $\ell _p$ regularized low-rank approximation via iterative reweighted singular value minimization, Affine matrix rank minimization problem via non-convex fraction function penalty, Sparse Legendre expansions via $\ell_1$-minimization, Phase transitions for greedy sparse approximation algorithms, Group sparse recovery in impulsive noise via alternating direction method of multipliers, The residual method for regularizing ill-posed problems, Iterative reweighted total generalized variation based Poisson noise removal model, New insights on the optimality conditions of the $\ell_2-\ell_0$ minimization problem, Perturbations of measurement matrices and dictionaries in compressed sensing, New bounds on the restricted isometry constant $\delta _{2k}$, Restricted $p$-isometry properties of partially sparse signal recovery, A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations, Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework, An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration, New bounds for RIC in compressed sensing, Bound alternative direction optimization for image deblurring, Iterative reweighted minimization methods for $l_p$ regularized unconstrained nonlinear programming, Stable recovery of sparse signals via $\ell_p$-minimization, Compressed sensing with preconditioning for sparse recovery with subsampled matrices of Slepian prolate functions, Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation, 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$, Univariate $L^p$ and $l^p$ averaging, $0<p<1$, in polynomial time by utilization of statistical structure, On the null space property of $l_q$-minimization for $0 < q \leq 1$ in compressed sensing, Sparse optimization of vibration signal by ADMM, Analysis of the ratio of $\ell_1$ and $\ell_2$ norms in compressed sensing, Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery, Sparse signal recovery with prior information by iterative reweighted least squares algorithm, An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion, Sparse recovery in probability via $l_q$-minimization with Weibull random matrices for $0 < q\leq 1$, A LogTVSCAD nonconvex regularization model for image deblurring in the presence of impulse noise, A modified greedy analysis pursuit algorithm for the cosparse analysis model, The sparsest solutions to $Z$-tensor complementarity problems, Iterative reweighted methods for $\ell _1-\ell _p$ minimization, A reweighted nuclear norm minimization algorithm for low rank matrix recovery, Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO, A new globally convergent algorithm for non-Lipschitz $\ell_{p}-\ell_q$ minimization, The null space property for sparse recovery from multiple measurement vectors, Restricted $p$-isometry property and its application for nonconvex compressive sensing, Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms, On uncertainty principles in the finite dimensional setting, Compressed sensing with coherent and redundant dictionaries, Iterative reweighted noninteger norm regularizing SVM for gene expression data classification, A numerical exploration of compressed sampling recovery, On support sizes of restricted isometry constants, Improved bounds for restricted isometry constants, Sparse recovery by non-convex optimization - instance optimality, A note on guaranteed sparse recovery via $\ell_1$-minimization, Iterative re-weighted least squares algorithm for $l_p$-minimization with tight frame and $0 < p \leq 1$, On a monotone scheme for nonconvex nonsmooth optimization with applications to fracture mechanics, Capped $\ell_p$ approximations for the composite $\ell_0$ regularization problem, Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm, New regularization method and iteratively reweighted algorithm for sparse vector recovery, A unified primal dual active set algorithm for nonconvex sparse recovery, A survey on semi-supervised feature selection methods, A null space analysis of the $\ell_1$-synthesis method in dictionary-based compressed sensing, Convergence of the reweighted $\ell_1$ minimization algorithm for $\ell_2-\ell_p$ minimization, A new smoothed L0 regularization approach for sparse signal recovery, A new sparse recovery method for the inverse acoustic scattering problem, Uniform recovery from subgaussian multi-sensor measurements, A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems, Dual-density-based reweighted $\ell_1$-algorithms for a class of $\ell_0$-minimization problems, An active set Barzilar-Borwein algorithm for $l_0$ regularized optimization, Accelerated iterative hard thresholding algorithm for $l_0$ regularized regression problem, An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing, The sparsest solution of the union of finite polytopes via its nonconvex relaxation, A simple Gaussian measurement bound for exact recovery of block-sparse signals, The $\ell_{2,q}$ regularized group sparse optimization: lower bound theory, recovery bound and algorithms, Preserving injectivity under subgaussian mappings and its application to compressed sensing, Sampling strategies for uncertainty reduction in categorical random fields: formulation, mathematical analysis and application to multiple-point simulations, A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation, Robust sparse recovery via a novel convex model, Optimal RIP bounds for sparse signals recovery via $\ell_p$ minimization, A convex relaxation framework consisting of a primal-dual alternative algorithm for solving $\ell_0$ sparsity-induced optimization problems with application to signal recovery based image restoration, The $\ell_{2,p}$ regularized total variation with overlapping group sparsity prior for image restoration with impulse noise, Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems, Entropy function-based algorithms for solving a class of nonconvex minimization problems

Cites Work

Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0