Efficient projection algorithms onto the weighted _1 ball
From MaRDI portal
Publication:2124458
DOI10.1016/J.ARTINT.2022.103683OpenAlexW4212946789MaRDI QIDQ2124458FDOQ2124458
Authors: Guillaume Perez, Sebastian Ament, Carla P. Gomes, Michel Barlaud 
Publication date: 11 April 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.02980
Cites Work
- Probing the Pareto frontier for basis pursuit solutions
- Title not available (Why is that?)
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Introduction to algorithms
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Compressed sensing
- SLOPE-adaptive variable selection via convex optimization
- Sparse Reconstruction by Separable Approximation
- On sufficiency of the Kuhn-Tucker conditions
- Validation of subgradient optimization
- Sparse Approximate Solutions to Linear Systems
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- Fast projection onto the simplex and the \(l_1\) ball
- Stable feature selection for biomarker discovery
- Online Sparse System Identification and Signal Reconstruction Using Projections Onto Weighted $\ell_{1}$ Balls
- A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball
Cited In (2)
Uses Software
This page was built for publication: Efficient projection algorithms onto the weighted \(\ell_1\) ball
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124458)
