Pages that link to "Item:Q2436652"
From MaRDI portal
The following pages link to Complexity of unconstrained \(L_2 - L_p\) minimization (Q2436652):
Displayed 14 items.
- Non-convex ℓ<sub><i>p</i></sub> regularization for sparse reconstruction of electrical impedance tomography (Q5152262) (← links)
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity (Q5348469) (← links)
- Penalty Methods for a Class of Non-Lipschitz Optimization Problems (Q5741071) (← links)
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions (Q5860273) (← links)
- Sparse Solutions of a Class of Constrained Optimization Problems (Q5868942) (← links)
- An efficient semismooth Newton method for adaptive sparse signal recovery problems (Q5882234) (← links)
- A communication-efficient method for ℓ<sub>0</sub> regularization linear regression models (Q6074135) (← links)
- Neural network for a class of sparse optimization with \(L_0\)-regularization (Q6077003) (← links)
- Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix (Q6120849) (← links)
- On the convex hull of convex quadratic optimization problems with indicators (Q6120854) (← links)
- A wonderful triangle in compressed sensing (Q6122304) (← links)
- A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities (Q6126602) (← links)
- An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems (Q6164017) (← links)
- A reduced half thresholding algorithm (Q6164988) (← links)