Pages that link to "Item:Q3507945"
From MaRDI portal
The following pages link to Restricted isometry properties and nonconvex compressive sensing (Q3507945):
Displaying 50 items.
- An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization (Q2142534) (← links)
- The springback penalty for robust signal recovery (Q2168687) (← links)
- Signal separation under coherent dictionaries and \(\ell_p\)-bounded noise (Q2223572) (← links)
- An L0-regularized global anisotropic gradient prior for single-image de-raining (Q2247395) (← links)
- A reweighted nuclear norm minimization algorithm for low rank matrix recovery (Q2252420) (← links)
- Robust PCA and subspace tracking from incomplete observations using \(\ell _0\)-surrogates (Q2259730) (← links)
- Iterative reweighted noninteger norm regularizing SVM for gene expression data classification (Q2262318) (← links)
- Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\) (Q2273889) (← links)
- On a monotone scheme for nonconvex nonsmooth optimization with applications to fracture mechanics (Q2275329) (← links)
- On sparse beamformer design with reverberation (Q2295315) (← links)
- A ``nonconvex+nonconvex'' approach for image restoration with impulse noise removal (Q2306771) (← links)
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem (Q2307753) (← links)
- An adaptive algorithm for TV-based model of three norms \(L_q\) \((q = \frac{1}{2}, 1, 2)\) in image restoration (Q2318218) (← links)
- A simple Gaussian measurement bound for exact recovery of block-sparse signals (Q2320652) (← links)
- Truncated sparse approximation property and truncated \(q\)-norm minimization (Q2322801) (← links)
- Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization (Q2330928) (← links)
- Stable recovery of low rank matrices from nuclear norm minimization (Q2343583) (← links)
- First- and second-order necessary conditions via exact penalty functions (Q2349834) (← links)
- \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems (Q2364127) (← links)
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing (Q2411691) (← links)
- Complexity of unconstrained \(L_2 - L_p\) minimization (Q2436652) (← links)
- Concentration of \(S\)-largest mutilated vectors with \(\ell_p\)-quasinorm for \(0<p\leq 1\) and its applications (Q2449220) (← links)
- Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization (Q2629808) (← links)
- Solving nonsmooth and discontinuous optimal power flow problems via interior-point \(\ell_p\)-penalty approach (Q2669712) (← links)
- The equivalence of three types of error bounds for weakly and approximately convex functions (Q2671442) (← links)
- \(L_2\)-\(L_q\) reconstruction model for computational spectrometer (Q2677865) (← 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)
- Linearly Constrained Non-Lipschitz Optimization for Image Restoration (Q3454492) (← links)
- Optimality conditions for the constrained<i>L</i><sub><i>p</i></sub>-regularization (Q3454863) (← links)
- A smoothing majorization method for matrix minimization (Q3458812) (← links)
- Quantization and Compressive Sensing (Q3460834) (← links)
- Iteratively reweighted least squares minimization for sparse recovery (Q3655588) (← links)
- Sparse signal recovery via non-convex optimization and overcomplete dictionaries (Q4554319) (← links)
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems (Q4602329) (← links)
- A Discretized Newton Flow for Time-Varying Linear Inverse Problems (Q4922843) (← links)
- Model selection for hybrid dynamical systems via sparse regression (Q4973922) (← links)
- Sparse Solutions by a Quadratically Constrained ℓq (0 <<i>q</i>< 1) Minimization Model (Q4995085) (← links)
- One-bit compressed sensing via <i> <b>ℓ</b> </i> <sub> <i>p</i> </sub>(<b>0</b> <b><</b> <i>p</i> <b><</b> <b>1</b>)-minimization method (Q5000599) (← links)
- <b> <i>ℓ</i> <sub>1</sub> − <i>αℓ</i> <sub>2</sub> </b> minimization methods for signal and image reconstruction with impulsive noise removal (Q5000605) (← links)
- The Dantzig selector: recovery of signal via ℓ <sub>1</sub> − αℓ <sub>2</sub> minimization (Q5014489) (← links)
- Low rank matrix recovery with adversarial sparse noise* (Q5030160) (← links)
- Sufficient conditions on stable reconstruction of weighted problem (Q5037937) (← links)
- Sparse phase retrieval via ℓp (0 < p ≤ 1) minimization (Q5063218) (← links)
- Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems (Q5093646) (← links)
- Perfect reconstruction of sparse signals with piecewise continuous nonconvex penalties and nonconvexity control (Q5152596) (← links)
- The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty (Q5162621) (← links)
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms (Q5219700) (← links)
- The probabilistic estimates on the largest and smallest $q$-singular values of random matrices (Q5246840) (← links)
- Minimization of $\ell_{1-2}$ for Compressed Sensing (Q5251929) (← links)