Pages that link to "Item:Q493283"

The following pages link to Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\) (Q493283):

Displaying 50 items.

• Point source super-resolution via non-convex \(L_1\) based methods (Q333212) (← links)
• Variational multiplicative noise removal by DC programming (Q333222) (← links)
• Alternating direction method of multipliers with difference of convex functions (Q723734) (← links)
• DC programming and DCA for solving Brugnano-Casulli piecewise linear systems (Q1652418) (← 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)
• \(\ell_1\)- and \(\ell_2\)-norm joint regularization based sparse signal reconstruction scheme (Q1793017) (← links)
• A sparse optimization problem with hybrid \(L_2\)-\(L_p\) regularization for application of magnetic resonance brain images (Q2060052) (← links)
• On the grouping effect of the \(l_{1-2}\) models (Q2093808) (← links)
• Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence (Q2124198) (← links)
• Transformed \(\ell_1\) regularization for learning sparse deep neural networks (Q2185659) (← links)
• Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing (Q2411691) (← links)
• A novel regularization based on the error function for sparse recovery (Q2660696) (← links)
• A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization (Q2667049) (← links)
• A new hybrid \(l_p\)-\(l_2\) model for sparse solutions with applications to image processing (Q2691208) (← links)
• Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation (Q2964447) (← 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)
• Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems (Q4641680) (← links)
• Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization (Q4997175) (← links)
• An image sharpening operator combined with framelet for image deblurring (Q5000589) (← links)
• <b> <i>ℓ</i> ₁ − <i>αℓ</i> ₂ </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)
• The Dantzig selector: recovery of signal via ℓ ₁ − αℓ ₂ minimization (Q5014489) (← links)
• A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization (Q5016825) (← links)
• A General Framework of Rotational Sparse Approximation in Uncertainty Quantification (Q5052909) (← links)
• Minimization of $L_1$ Over $L_2$ for Sparse Signal Recovery with Convergence Guarantee (Q5071446) (← links)
• Image Segmentation via Fischer-Burmeister Total Variation and Thresholding (Q5077133) (← links)
• Stable Image Reconstruction Using Transformed Total Variation Minimization (Q5094633) (← links)
• Iteratively Reweighted Group Lasso Based on Log-Composite Regularization (Q5161764) (← links)
• A Scale-Invariant Approach for Sparse Signal Recovery (Q5204007) (← links)
• Minimization of $\ell_{1-2}$ for Compressed Sensing (Q5251929) (← links)
• New Restricted Isometry Property Analysis for $\ell_1-\ell_2$ Minimization Methods (Q5860293) (← links)
• Limited-Angle CT Reconstruction via the $L_1/L_2$ Minimization (Q5860341) (← links)
• A Weighted Difference of Anisotropic and Isotropic Total Variation for Relaxed Mumford--Shah Color and Multiphase Image Segmentation (Q5860354) (← links)
• Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise (Q5863519) (← links)
• An efficient semismooth Newton method for adaptive sparse signal recovery problems (Q5882234) (← links)
• Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum (Q6101532) (← links)
• Sorted \(L_1/L_2\) minimization for sparse signal recovery (Q6120011) (← links)
• Structured model selection via ℓ1−ℓ2 optimization (Q6141559) (← links)
• \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery (Q6144050) (← links)
• Enhanced total variation minimization for stable image reconstruction (Q6162738) (← links)
• \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization (Q6181376) (← links)
• Open issues and recent advances in DC programming and DCA (Q6200375) (← links)
• k-Sparse Vector Recovery via $$\ell _1-\alpha \ell _2$$ Local Minimization (Q6493963) (← links)
• A proximal alternating direction method of multipliers for DC programming with structured constraints (Q6536834) (← links)
• A stochastic ADMM algorithm for large-scale ptychography with weighted difference of anisotropic and isotropic total variation (Q6557664) (← links)
• Matrix recovery from nonconvex regularized least absolute deviations (Q6557678) (← links)
• A parameterized three-operator splitting algorithm for non-convex minimization problems with applications (Q6561488) (← links)