Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model
From MaRDI portal
Publication:4995085
DOI10.1287/ijoc.2020.1004OpenAlexW3090968324MaRDI QIDQ4995085
Shan Jiang, Qing-Wei Jin, Shu-Cherng Fang
Publication date: 23 June 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2020.1004
nonsmooth optimizationimage processingoptimality conditionsparse solutionsparse signal recoverynonconex optimization
Related Items
Uses Software
Cites Work
- Unnamed Item
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron
- Sparse solutions of linear complementarity problems
- DC approximation approaches for sparse optimization
- On constraint qualifications: motivation, design and inter-relations
- A note on the complexity of \(L _{p }\) minimization
- Iterative thresholding for sparse approximations
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- The restricted isometry property and its implications for compressed sensing
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- An improved algorithm for the \(L_2-L_p\) minimization problem
- Least angle regression. (With discussion)
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- Complexity of unconstrained \(L_2 - L_p\) minimization
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Atomic Decomposition by Basis Pursuit
- OR Forum—An Algorithmic Approach to Linear Regression
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- Restricted isometry properties and nonconvex compressive sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Probing the Pareto Frontier for Basis Pursuit Solutions
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Iterative positive thresholding algorithm for non-negative sparse optimization
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Sparse Approximate Solutions to Linear Systems
- A Knowledge Gradient Policy for Sequencing Experiments to Identify the Structure of RNA Molecules Using a Sparse Additive Belief Model
- Generalized Conjugate Gradient Methods for ℓ1 Regularized Convex Quadratic Programming with Finite Convergence
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Constraint qualifications in maximization problems
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Constrained Minimization Problems in Finite-Dimensional Spaces
- Compressed sensing
