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.
- Bound alternative direction optimization for image deblurring (Q1717868) (← links)
- On monotone and primal-dual active set schemes for \(\ell^p\)-type problems, \(p \in (0,1]\) (Q1734767) (← links)
- Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\) (Q1736367) (← links)
- Univariate \(L^p\) and \(l^p\) averaging, \(0<p<1\), in polynomial time by utilization of statistical structure (Q1736520) (← links)
- Sparse signal recovery with prior information by iterative reweighted least squares algorithm (Q1746492) (← links)
- Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\) (Q1747365) (← links)
- Iterative reweighted methods for \(\ell _1-\ell _p\) minimization (Q1753073) (← links)
- Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem (Q1785036) (← links)
- Restricted \(p\)-isometry properties of partially sparse signal recovery (Q1956098) (← links)
- Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing (Q1979938) (← links)
- An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion (Q1988232) (← links)
- A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization (Q2000528) (← links)
- Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm (Q2031758) (← links)
- New regularization method and iteratively reweighted algorithm for sparse vector recovery (Q2033724) (← links)
- A unified primal dual active set algorithm for nonconvex sparse recovery (Q2038299) (← links)
- Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems (Q2052391) (← links)
- An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing (Q2059822) (← links)
- Robust sparse recovery via a novel convex model (Q2079105) (← links)
- 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 (Q2095175) (← links)
- The \(\ell_{2,p}\) regularized total variation with overlapping group sparsity prior for image restoration with impulse noise (Q2098805) (← links)
- Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems (Q2105897) (← links)
- Sparse data-driven quadrature rules via \(\ell^p\)-quasi-norm minimization (Q2134455) (← links)
- The springback penalty for robust signal recovery (Q2168687) (← links)
- A globally convergent algorithm for a constrained non-Lipschitz image restoration model (Q2173566) (← links)
- A smoothing neural network for minimization \(l_1\)-\(l_p\) in sparse signal reconstruction with measurement noises (Q2185680) (← links)
- Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm (Q2190319) (← links)
- A smoothing method for sparse optimization over convex sets (Q2191281) (← links)
- Group sparse recovery in impulsive noise via alternating direction method of multipliers (Q2197950) (← links)
- New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem (Q2203360) (← links)
- A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations (Q2211058) (← links)
- Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation (Q2220667) (← links)
- Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery (Q2238869) (← links)
- A LogTVSCAD nonconvex regularization model for image deblurring in the presence of impulse noise (Q2244367) (← links)
- A reweighted nuclear norm minimization algorithm for low rank matrix recovery (Q2252420) (← links)
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO (Q2252508) (← links)
- Iterative reweighted noninteger norm regularizing SVM for gene expression data classification (Q2262318) (← links)
- A numerical exploration of compressed sampling recovery (Q2267399) (← 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)
- A survey on semi-supervised feature selection methods (Q2290330) (← links)
- A new smoothed L0 regularization approach for sparse signal recovery (Q2298142) (← links)
- A new sparse recovery method for the inverse acoustic scattering problem (Q2300540) (← links)
- Uniform recovery from subgaussian multi-sensor measurements (Q2300757) (← links)
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems (Q2301146) (← links)
- An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization (Q2307750) (← links)
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem (Q2307753) (← links)
- The sparsest solution of the union of finite polytopes via its nonconvex relaxation (Q2311128) (← links)
- A simple Gaussian measurement bound for exact recovery of block-sparse signals (Q2320652) (← links)
- Sampling strategies for uncertainty reduction in categorical random fields: formulation, mathematical analysis and application to multiple-point simulations (Q2325286) (← links)
- Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization (Q2330928) (← links)
