Efficient projection algorithms onto the weighted ℓ1 ball
- 23 February 2022
- journal article
- research article
- Published by Elsevier BV in Artificial Intelligence
- Vol. 306, 103683
- https://doi.org/10.1016/j.artint.2022.103683
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Convergence of the reweighted ℓ 1 minimization algorithm for ℓ 2–ℓ p minimizationComputational Optimization and Applications, 2013
- Online Sparse System Identification and Signal Reconstruction Using Projections Onto Weighted $\ell_{1}$ BallsIEEE Transactions on Signal Processing, 2010
- Robust biomarker identification for cancer diagnosis with ensemble feature selection methodsBioinformatics, 2009
- Probing the Pareto Frontier for Basis Pursuit SolutionsSIAM Journal on Scientific Computing, 2009
- Highly Undersampled Magnetic Resonance Image Reconstruction via Homotopic $\ell_{0}$-MinimizationIEEE Transactions on Medical Imaging, 2008
- Breakpoint searching algorithms for the continuous quadratic knapsack problemMathematical Programming, 2006
- Sparse Approximate Solutions to Linear SystemsSIAM Journal on Computing, 1995
- A finite algorithm for finding the projection of a point onto the canonical simplex of ? nJournal of Optimization Theory and Applications, 1986
- On sufficiency of the Kuhn-Tucker conditionsJournal of Mathematical Analysis and Applications, 1981
- Validation of subgradient optimizationMathematical Programming, 1974