Pages that link to "Item:Q5251929"
From MaRDI portal
The following pages link to Minimization of $\ell_{1-2}$ for Compressed Sensing (Q5251929):
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)
- \(l_1\)-\(l_2\) regularization of split feasibility problems (Q1652788) (← links)
- Enhancing matrix completion using a modified second-order total variation (Q1727032) (← links)
- A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem (Q1729942) (← links)
- Fast L1-L2 minimization via a proximal operator (Q1742664) (← links)
- A proximal difference-of-convex algorithm with extrapolation (Q1744881) (← 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)
- Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing (Q1979938) (← links)
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions (Q1986404) (← links)
- Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations (Q2022171) (← links)
- Image restoration based on fractional-order model with decomposition: texture and cartoon (Q2064956) (← links)
- Perturbation analysis of \(L_{1-2}\) method for robust sparse recovery (Q2082139) (← links)
- A Lagrange-Newton algorithm for sparse nonlinear programming (Q2089792) (← links)
- On the grouping effect of the \(l_{1-2}\) models (Q2093808) (← links)
- The proximity operator of the log-sum penalty (Q2103448) (← links)
- Semi-supervised learning-assisted imaging method for electrical capacitance tomography (Q2109439) (← links)
- A unified Douglas-Rachford algorithm for generalized DC programming (Q2114583) (← links)
- Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence (Q2124198) (← links)
- Low-rank matrix recovery with Ky Fan 2-\(k\)-norm (Q2124796) (← links)
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems (Q2125070) (← links)
- Nonconvex regularization for blurred images with Cauchy noise (Q2128601) (← links)
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing (Q2142552) (← links)
- Explicit lower bounds on \(|L (1, \chi)|\) (Q2161352) (← links)
- Kurdyka-Łojasiewicz exponent via inf-projection (Q2162122) (← links)
- Gradient projection Newton pursuit for sparsity constrained optimization (Q2168680) (← links)
- The springback penalty for robust signal recovery (Q2168687) (← links)
- A solution approach for cardinality minimization problem based on fractional programming (Q2168753) (← links)
- A nonconvex \(l_1 (l_1-l_2)\) model for image restoration with impulse noise (Q2178405) (← 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 new nonconvex approach for image restoration with Gamma noise (Q2203959) (← links)
- A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations (Q2211058) (← links)
- Relating \(\ell_p\) regularization and reweighted \(\ell_1\) regularization (Q2230788) (← links)
- RIP-based performance guarantee for low-tubal-rank tensor recovery (Q2306402) (← links)
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems (Q2307744) (← links)
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions (Q2309799) (← links)
- The modified second APG method for DC optimization problems (Q2311112) (← links)
- Further properties of the forward-backward envelope with applications to difference-of-convex programming (Q2364125) (← links)
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing (Q2411691) (← links)
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection (Q2419541) (← links)
- A novel regularization based on the error function for sparse recovery (Q2660696) (← links)
- Newton method for \(\ell_0\)-regularized optimization (Q2665935) (← 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)
- Robust signal recovery via \(\ell_{1-2}/ \ell_p\) minimization with partially known support (Q2681229) (← links)
- Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems (Q2688921) (← links)