Efficient projection algorithms onto the weighted \(\ell_1\) ball

DOI10.1016/j.artint.2022.103683OpenAlexW4212946789MaRDI QIDQ2124458

Michel Barlaud, Carla P. Gomes, Guillaume Perez, Sebastian Ament

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

zbMATH Keywords

optimizationvariable selectiongradient-based methods

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Uses Software

• SPGL1

Cites Work

• Unnamed Item
• Unnamed Item
• Fast projection onto the simplex and the \(l_1\) ball
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
• SLOPE-adaptive variable selection via convex optimization
• A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
• On sufficiency of the Kuhn-Tucker conditions
• Stable feature selection for biomarker discovery
• A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball
• Breakpoint searching algorithms for the continuous quadratic knapsack problem
• Probing the Pareto Frontier for Basis Pursuit Solutions
• Sparse Reconstruction by Separable Approximation
• Online Sparse System Identification and Signal Reconstruction Using Projections Onto Weighted $\ell_{1}$ Balls
• Validation of subgradient optimization
• Sparse Approximate Solutions to Linear Systems
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Compressed sensing

This page was built for publication: Efficient projection algorithms onto the weighted \(\ell_1\) ball