Efficient Projection onto the ℓ∞, 1 Mixed-Norm Ball Using a Newton Root Search Method

Mixed norms that promote structured sparsity have numerous applications in signal processing and machine learning problems. In this work, we present a new algorithm, based on a Newton root search t...

[1]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[2]  Mark W. Schmidt,et al.  Optimizing Costly Functions with Simple Constraints: A Limited-Memory Projected Quasi-Newton Algorithm , 2009, AISTATS.

[3]  B. Wohlberg,et al.  Fast Projection onto the 𝓁 ∞, 1 -Mixed Norm Ball Using Steffensen Root Search. , 2018, ICASSP 2018.

[4]  Jun Liu,et al.  Efficient Euclidean projections in linear time , 2009, ICML '09.

[5]  Trevor Darrell,et al.  An efficient projection for l1, ∞ regularization , 2009, ICML '09.

[6]  Paul Rodríguez,et al.  Accelerated Gradient Descent Method for Projections onto the $\ell_{1}$ -Ball , 2018, 2018 IEEE 13th Image, Video, and Multidimensional Signal Processing Workshop (IVMSP).

[7]  C. Michelot A finite algorithm for finding the projection of a point onto the canonical simplex of ∝n , 1986 .

[8]  K. Kiwiel Variable Fixing Algorithms for the Continuous Quadratic Knapsack Problem , 2008 .

[9]  Han Liu,et al.  Blockwise coordinate descent procedures for the multi-task lasso, with applications to neural semantic basis discovery , 2009, ICML '09.

[10]  Laurent Condat,et al.  Fast projection onto the simplex and the $$\pmb {l}_\mathbf {1}$$l1 ball , 2016, Math. Program..

[11]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[12]  S. Sra Generalized Proximity and Projection with Norms and Mixed-norms , 2010 .

[13]  S. H. Lui,et al.  Pure and Applied Mathematics: A Wiley Series of Texts, Monographs and Tracts , 2011 .

[14]  S. Amat,et al.  An Overview on Steffensen-Type Methods , 2016 .

[15]  Stephen J. Wright,et al.  Simultaneous Variable Selection , 2005, Technometrics.

[16]  Heinz H. Bauschke,et al.  Convex Analysis and Monotone Operator Theory in Hilbert Spaces , 2011, CMS Books in Mathematics.

[17]  A. Fiacco A Finite Algorithm for Finding the Projection of a Point onto the Canonical Simplex of R " , 2009 .

[18]  M. Kowalski Sparse regression using mixed norms , 2009 .

[19]  Roberto Cominetti,et al.  A Newton’s method for the continuous quadratic knapsack problem , 2014, Math. Program. Comput..

[20]  Yangyang Xu,et al.  First-order methods for constrained convex programming based on linearized augmented Lagrangian function , 2017, INFORMS Journal on Optimization.

[21]  Alkiviadis G. Akritas On the Budan-Fourier controversy , 1981, SIGS.

[22]  Tom Michael Mitchell,et al.  Predicting Human Brain Activity Associated with the Meanings of Nouns , 2008, Science.

[23]  Laurent Condat Fast projection onto the simplex and the lll 1 ball , 2014 .

[24]  Rodriguez Paul An accelerated newton's method for projections onto the l1-ball , 2017 .

[25]  Jieping Ye,et al.  Efficient Methods for Overlapping Group Lasso , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[26]  Suvrit Sra Fast projections onto mixed-norm balls with applications , 2012, Data Mining and Knowledge Discovery.

[27]  Stephen P. Boyd,et al.  Proximal Algorithms , 2013, Found. Trends Optim..

[28]  Michael P. Friedlander,et al.  Probing the Pareto Frontier for Basis Pursuit Solutions , 2008, SIAM J. Sci. Comput..

[29]  A. Gramfort,et al.  Mixed-norm estimates for the M/EEG inverse problem using accelerated gradient methods , 2012, Physics in medicine and biology.

[30]  Suvrit Sra,et al.  Fast Projections onto ℓ1, q -Norm Balls for Grouped Feature Selection , 2011, ECML/PKDD.

[31]  Changshui Zhang,et al.  Efficient Euclidean projections via Piecewise Root Finding and its application in gradient projection , 2011, Neurocomputing.

[32]  Yoram Singer,et al.  Efficient projections onto the l1-ball for learning in high dimensions , 2008, ICML '08.

[33]  Krzysztof C. Kiwiel,et al.  Breakpoint searching algorithms for the continuous quadratic knapsack problem , 2007, Math. Program..

[34]  Laurent Condat,et al.  A Convex Approach to K-Means Clustering and Image Segmentation , 2017, EMMCVPR.