Pages that link to "Item:Q1012556"
From MaRDI portal
The following pages link to Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\) (Q1012556):
Displaying 50 items.
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit (Q2330942) (← links)
- A non-convex algorithm framework based on DC programming and DCA for matrix completion (Q2340366) (← links)
- Error analysis of reweighted \(l_1\) greedy algorithm for noisy reconstruction (Q2345681) (← links)
- On the Kähler form of complex \(L^{p}\) space and its Lagrangian subspaces (Q2352169) (← links)
- Optimal \(D\)-RIP bounds in compressed sensing (Q2353238) (← links)
- Rank-one and sparse matrix decomposition for dynamic MRI (Q2353466) (← links)
- Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery (Q2360780) (← links)
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing (Q2411691) (← links)
- RNLp: mixing nonlocal and TV-Lp methods to remove impulse noise from images (Q2417936) (← links)
- Nonconvex mixed TV/Cahn-Hilliard functional for super-resolution/segmentation of 3D trabecular bone images (Q2417939) (← links)
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection (Q2419541) (← links)
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation (Q2419549) (← links)
- Complexity of unconstrained \(L_2 - L_p\) minimization (Q2436652) (← links)
- Stability and robustness of \(\ell_1\)-minimizations with Weibull matrices and redundant dictionaries (Q2437330) (← links)
- Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices (Q2437333) (← links)
- Concentration of \(S\)-largest mutilated vectors with \(\ell_p\)-quasinorm for \(0<p\leq 1\) and its applications (Q2449220) (← links)
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation (Q2516375) (← links)
- Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization (Q2629808) (← links)
- On the Schatten \(p\)-quasi-norm minimization for low-rank matrix recovery (Q2659733) (← links)
- A proximal algorithm with backtracked extrapolation for a class of structured fractional programming (Q2667040) (← links)
- A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization (Q2667049) (← links)
- Compressive Sensing (Q2789803) (← links)
- Recovery of Low Rank Symmetric Matrices via Schatten p Norm Minimization (Q2800802) (← links)
- DC Approximation Approach for ℓ0-minimization in Compressed Sensing (Q2808067) (← links)
- Fast Implementation of ℓ 1-Greedy Algorithm (Q2840660) (← links)
- EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION (Q2846490) (← links)
- Stability of lq-analysis based dual frame with Weibull matrices for 0 < q ≤ 1 (Q2958494) (← links)
- Constructing New Weighted <i>ℓ</i><sub>1</sub>-Algorithms for the Sparsest Points of Polyhedral Sets (Q2976140) (← links)
- Necessary and sufficient conditions for linear convergence of ℓ1-regularization (Q3068374) (← links)
- A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem (Q3192668) (← links)
- Evaluation of generalized degrees of freedom for sparse estimation by replica method (Q3302495) (← links)
- THE RESTRICTED ISOMETRY PROPERTY FOR SIGNAL RECOVERY WITH COHERENT TIGHT FRAMES (Q3458390) (← links)
- A Survey of Compressed Sensing (Q3460827) (← links)
- Sparse signal recovery via non-convex optimization and overcomplete dictionaries (Q4554319) (← links)
- Sparsest representations and approximations of an underdetermined linear system (Q4569345) (← links)
- Weighted ${\ell}_{{1}}$-minimization for sparse recovery under arbitrary prior information (Q4603710) (← links)
- A null-space-based weighted<i>l</i><sub>1</sub>minimization approach to compressed sensing (Q4603732) (← links)
- Least Sparsity of $p$-Norm Based Optimization Problems with $p>1$ (Q4687239) (← links)
- Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere (Q4689765) (← links)
- An ℓ<sub>q</sub>- Seminorm Variational Model for Impulse Noise Reduction (Q4985227) (← links)
- Sparse Solutions by a Quadratically Constrained ℓq (0 <<i>q</i>< 1) Minimization Model (Q4995085) (← links)
- (Q4999097) (← links)
- On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms (Q5000580) (← links)
- A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization (Q5016825) (← links)
- An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model <sup>*</sup> (Q5019920) (← links)
- Sufficient conditions on stable reconstruction of weighted problem (Q5037937) (← links)
- A General Non-Lipschitz Infimal Convolution Regularized Model: Lower Bound Theory and Algorithm (Q5043740) (← links)
- Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems (Q5093646) (← links)
- The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials (Q5094726) (← links)
- Recovery analysis for block ℓp − ℓ1 minimization with prior support information (Q5097858) (← links)
