An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems

DOI10.1137/090775397zbMath1220.65051OpenAlexW2084978503MaRDI QIDQ3004975

Publication date: 6 June 2011

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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

zbMATH Keywords

convergence iterative algorithm regularisation compressed sensing sparse solution $\ell_q$ minimization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10)

Related Items

A smoothing iterative method for quantile regression with nonconvex $\ell_p$ penalty, A Barzilai-Borwein-like iterative half thresholding algorithm for the $L_{1/2}$ regularized problem, A smoothing SQP framework for a class of composite $L_q$ minimization over polyhedron, Linearly Constrained Non-Lipschitz Optimization for Image Restoration, Sparse phase retrieval via ℓp (0 < p ≤ 1) minimization, The non-convex sparse problem with nonnegative constraint for signal reconstruction, Unnamed Item, A joint matrix minimization approach for multi-image face recognition, An interior stochastic gradient method for a class of non-Lipschitz optimization problems, The springback penalty for robust signal recovery, A solution approach for cardinality minimization problem based on fractional programming, The sparsity of underdetermined linear system via $l_p$ minimization for $0 < p < 1$, Smoothing strategy along with conjugate gradient algorithm for signal reconstruction, A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing, Recent advances in mathematical programming with semi-continuous variables and cardinality constraint, An improved algorithm for the $L_2-L_p$ minimization problem, An extrapolated iteratively reweighted $\ell_1$ method with complexity analysis, Heuristics for Finding Sparse Solutions of Linear Inequalities, A generalized elastic net regularization with smoothed $\ell _{q}$ penalty for sparse vector recovery, Restricted normal cones and sparsity optimization with affine constraints, Sparse signal reconstruction via the approximations of $\ell_0$ quasinorm, A smoothing method for sparse optimization over convex sets, $\ell _p$ regularized low-rank approximation via iterative reweighted singular value minimization, Nonconvex $\ell_p-\alpha\ell_q$ minimization method and $p$-RIP condition for stable recovery of approximately $k$-sparse signals, Affine matrix rank minimization problem via non-convex fraction function penalty, An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems, Rotation to sparse loadings using $L^p$ losses and related inference problems, Convergence rate analysis of proximal iteratively reweighted $\ell_1$ methods for $\ell_p$ regularization problems, A new hybrid $l_p$-$l_2$ model for sparse solutions with applications to image processing, Complexity of unconstrained $L_2 - L_p$ minimization, A new nonconvex approach to low-rank matrix completion with application to image inpainting, An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration, Iterative reweighted minimization methods for $l_p$ regularized unconstrained nonlinear programming, On constrained optimization with nonconvex regularization, Relating $\ell_p$ regularization and reweighted $\ell_1$ regularization, On monotone and primal-dual active set schemes for $\ell^p$-type problems, $p \in (0,1$], Univariate $L^p$ and $l^p$ averaging, $0<p<1$, in polynomial time by utilization of statistical structure, Non-convex ℓ_p regularization for sparse reconstruction of electrical impedance tomography, Unnamed Item, Iterative reweighted methods for $\ell _1-\ell _p$ minimization, A reweighted nuclear norm minimization algorithm for low rank matrix recovery, A new globally convergent algorithm for non-Lipschitz $\ell_{p}-\ell_q$ minimization, Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems, Least Sparsity of $p$-Norm Based Optimization Problems with $p>1$, New regularization method and iteratively reweighted algorithm for sparse vector recovery, A gradient descent based algorithm for $\ell_p$ minimization, A unified primal dual active set algorithm for nonconvex sparse recovery, 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, Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods, Dual-density-based reweighted $\ell_1$-algorithms for a class of $\ell_0$-minimization problems, A sparse optimization problem with hybrid $L_2$-$L_p$ regularization for application of magnetic resonance brain images, The sparsest solution of the union of finite polytopes via its nonconvex relaxation, Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems, Non-Lipschitz Models for Image Restoration with Impulse Noise Removal, Matrix completion via minimizing an approximate rank, Fast Implementation of ℓ 1-Greedy Algorithm, The $\ell_{2,q}$ regularized group sparse optimization: lower bound theory, recovery bound and algorithms, A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation, Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model, On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms, A non-convex algorithm framework based on DC programming and DCA for matrix completion, A New Computational Method for the Sparsest Solutions to Systems of Linear Equations, Isotropic non-Lipschitz regularization for sparse representations of random fields on the sphere, Minimization of non-smooth, non-convex functionals by iterative thresholding, An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model ^*, Entropy function-based algorithms for solving a class of nonconvex minimization problems