Pages that link to "Item:Q2873273"
From MaRDI portal
The following pages link to A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications (Q2873273):
Displayed 48 items.
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\) (Q493283) (← links)
- Three \(l_1\) based nonconvex methods in constructing sparse mean reverting portfolios (Q1635895) (← links)
- DC programming and DCA for solving Brugnano-Casulli piecewise linear systems (Q1652418) (← links)
- \(l_1\)-\(l_2\) regularization of split feasibility problems (Q1652788) (← links)
- Fast L1-L2 minimization via a proximal operator (Q1742664) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing (Q1749455) (← links)
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
- Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing (Q1979938) (← links)
- High-dimensional sign-constrained feature selection and grouping (Q2042289) (← links)
- Penalized robust estimators in sparse logistic regression (Q2084709) (← links)
- The proximity operator of the log-sum penalty (Q2103448) (← links)
- Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence (Q2124198) (← links)
- The springback penalty for robust signal recovery (Q2168687) (← links)
- Smoothing inertial projection neural network for minimization \(L_{p-q}\) in sparse signal reconstruction (Q2179318) (← links)
- Transformed \(\ell_1\) regularization for learning sparse deep neural networks (Q2185659) (← links)
- Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm (Q2190319) (← links)
- A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations (Q2211058) (← links)
- Reconstruction of jointly sparse vectors via manifold optimization (Q2311804) (← links)
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization (Q2408897) (← links)
- A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning (Q2633537) (← links)
- A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization (Q2667049) (← links)
- Efficient color image segmentation via quaternion-based \(L_1/L_2\) Regularization (Q2674278) (← links)
- Morozov's discrepancy principle for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization (Q2697355) (← links)
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization (Q3130749) (← links)
- A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing (Q3192676) (← links)
- Heuristic discrepancy principle for variational regularization of inverse problems (Q3298412) (← links)
- Iterative positive thresholding algorithm for non-negative sparse optimization (Q4559400) (← links)
- Multicompartment magnetic resonance fingerprinting (Q4582674) (← links)
- Total Variation Regularization Strategies in Full-Waveform Inversion (Q4686921) (← 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)
- A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization (Q5005209) (← links)
- A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization (Q5016825) (← links)
- Minimization of $L_1$ Over $L_2$ for Sparse Signal Recovery with Convergence Guarantee (Q5071446) (← links)
- An Iterative Reduction FISTA Algorithm for Large-Scale LASSO (Q5088796) (← links)
- A Scale-Invariant Approach for Sparse Signal Recovery (Q5204007) (← links)
- $ \newcommand{\e}{{\rm e}} {\alpha\ell_{1}-\beta\ell_{2}}$ regularization for sparse recovery (Q5210419) (← links)
- An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems (Q5216783) (← links)
- Minimization of $\ell_{1-2}$ for Compressed Sensing (Q5251929) (← links)
- Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks (Q5739731) (← links)
- A smoothing inertial neural network for sparse signal reconstruction with noise measurements via \(L_p-L_1\) minimization (Q6045814) (← links)
- Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model (Q6062413) (← links)
- Study on \(L_1\) over \(L_2\) Minimization for nonnegative signal recovery (Q6101685) (← links)
- Structured model selection via ℓ1−ℓ2 optimization (Q6141559) (← links)
- Nonconvex \(\ell_p-\alpha\ell_q\) minimization method and \(p\)-RIP condition for stable recovery of approximately \(k\)-sparse signals (Q6151971) (← links)
- A reduced half thresholding algorithm (Q6164988) (← links)
- Open issues and recent advances in DC programming and DCA (Q6200375) (← links)
- An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost (Q6200957) (← links)