Iterative methods for projection onto the ℓ p quasi-norm ball
From MaRDI portal
Publication:6971044
Cites work
- A unified analysis of convex and non-convex \(\ell_p\)-ball projection problems
- A unifying analysis of projected gradient descent for \(\ell_p\)-constrained least squares
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
- Efficient dictionary learning with sparseness-enforcing projections
- Efficient projection algorithms onto the weighted \(\ell_1\) ball
- Iterative reweighted linear least squares for exact penalty subproblems on product sets
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- MM optimization algorithms
- Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods
- On Fejér monotone sequences and nonexpansive mappings
This page was built for publication: Iterative methods for projection onto the ℓ p quasi-norm ball
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971044)