Convex optimization with sparsityinducing norms. Foundations and Trends in Machine Learning, vol.4, pp.1-106, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00937150
Convex analysis and monotone operator theory in Hilbert spaces, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-01517477
, The best of both worlds. Computing in Science Engineering, vol.13, pp.31-39, 2011.
Square-root Lasso: pivotal recovery of sparse signals via conic programming, Biometrika, vol.98, issue.4, pp.791-806, 2011. ,
Active set strategy for high-dimensional non-convex sparse optimization problems, ICASSP, pp.1517-1521, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01025585
Nonlinear Acceleration of Momentum and Primal-Dual Algorithms, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01893921
A dynamic screening principle for the lasso, EUSIPCO, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00880787
, Convex optimization, 2004.
, , 2013.
Atomic decomposition by basis pursuit, SPIE, 1995. ,
Safe feature elimination in sparse supervised learning, J. Pacific Optim, vol.8, issue.4, pp.667-698, 2012. ,
Liblinear: A library for large linear classification, J. Mach. Learn. Res, vol.9, pp.1871-1874, 2008. ,
Sure independence screening for ultrahigh dimensional feature space, J. R. Stat. Soc. Ser. B Stat. Methodol, vol.70, issue.5, pp.849-911, 2008. ,
Accelerated, parallel and proximal coordinate descent, SIAM J. Optim, vol.25, issue.3, pp.1997-2013, 2015. ,
Mind the duality gap: safer rules for the lasso, ICML, pp.333-342, 2015. ,
Pathwise coordinate optimization, Ann. Appl. Stat, vol.1, issue.2, pp.302-332, 2007. ,
Regularization paths for generalized linear models via coordinate descent, J. Stat. Softw, vol.33, issue.1, p.1, 2010. ,
Mixed-norm estimates for the M/EEG inverse problem using accelerated gradient methods, Phys. Med. Biol, vol.57, issue.7, pp.1937-1961, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00690774
MNE software for processing MEG and EEG data, NeuroImage, vol.86, pp.446-460, 2014. ,
Fixed-point continuation for 1 -minimization: Methodology and convergence, SIAM J. Optim, vol.19, issue.3, pp.1107-1130, 2008. ,
Convex analysis and minimization algorithms, vol.II, 1993. ,
QUIC: Quadratic approximation for sparse inverse covariance estimation, J. Mach. Learn. Res, vol.15, pp.2911-2947, 2014. ,
Blitz: A principled meta-algorithm for scaling sparse optimization, ICML, pp.1171-1179, 2015. ,
A fast, principled working set algorithm for exploiting piecewise linear structure in convex problems, 2018. ,
Efficient Greedy Coordinate Descent for Composite Problems, 2018. ,
An interior-point method for large-scale l1-regularized logistic regression, J. Mach. Learn. Res, vol.8, issue.8, pp.1519-1555, 2007. ,
Accelerating ISTA with an active set strategy, OPT 2011: 4th International Workshop on Optimization for Machine Learning, p.7, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00696992
Numba: A LLVM-based Python JIT Compiler, Proceedings of the Second Workshop on the LLVM Compiler Infrastructure in HPC, pp.1-6, 2015. ,
Proximal Newton-type methods for convex optimization, NIPS, pp.827-835, 2012. ,
Sparse coding for machine learning, image processing and computer vision, 2010. ,
From safe screening rules to working sets for faster lasso-type solvers, 10th NIPS Workshop on Optimization for Machine Learning, 2017. ,
Celer: a fast solver for the Lasso with dual extrapolation, ICML, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01833398
Generalized Linear Models, CRC Monographs on Statistics and Applied Probability Series, 1989. ,
A constraint selection technique for a class of linear programs, Operations Research Letters, vol.7, issue.4, pp.191-195, 1988. ,
Gap safe screening rules for sparse multi-task and multi-class models, NIPS, pp.811-819, 2015. ,
GAP safe screening rules for sparsegroup-lasso, NIPS, 2016. ,
Gap safe screening rules for sparsity enforcing penalties, J. Mach. Learn. Res, vol.18, issue.128, pp.1-33, 2017. ,
Active-set complexity" of proximal gradient: how long does it take to find the sparsity pattern? Optimization Letters, pp.1-11, 2017. ,
Joint covariate selection and joint subspace selection for multiple classification problems, Statistics and Computing, vol.20, issue.2, pp.231-252, 2010. ,
Safe screening of non-support vectors in pathwise SVM computation, ICML, pp.1382-1390, 2013. ,
Nonlinear optimization by successive linear programming, Management Science, vol.28, issue.10, pp.1106-1120, 1982. ,
Scikit-learn: Machine learning in Python, J. Mach. Learn. Res, vol.12, pp.2825-2830, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00650905
Faster coordinate descent via adaptive importance sampling, AISTATS, pp.869-877, 2017. ,
Local convergence properties of SAGA/Prox-SVRG and acceleration, ICML, pp.4124-4132, 2018. ,
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function, Mathematical Programming, vol.144, issue.1-2, pp.1-38, 2014. ,
Boosting as a regularized path to a maximum margin classifier, J. Mach. Learn. Res, vol.5, pp.941-973, 2004. ,
The group-lasso for generalized linear models: uniqueness of solutions and efficient algorithms, ICML, pp.848-855, 2008. ,
A fast active set block coordinate descent algorithm for 1 -regularized least squares, SIAM J. Optim, vol.26, issue.1, pp.781-809, 2016. ,
, Complexity of inexact proximal Newton methods, 2013.
Acceleration in Optimization, 2018. ,
URL : https://hal.archives-ouvertes.fr/tel-01887163
Regularized nonlinear acceleration, NIPS, pp.712-720, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01384682
A sparse-group lasso, J. Comput. Graph. Statist, vol.22, issue.2, pp.231-245, 2013. ,
Are we there yet? manifold identification of gradient-related proximal methods, AISTATS, pp.1110-1119, 2019. ,
Techniques for removing nonbinding constraints and extraneous variables from linear programming problems, Management Science, vol.12, issue.7, pp.588-608, 1966. ,
Regression shrinkage and selection via the lasso, J. R. Stat. Soc. Ser. B Stat. Methodol, vol.58, issue.1, pp.267-288, 1996. ,
Strong rules for discarding predictors in lasso-type problems, J. R. Stat. Soc. Ser. B Stat. Methodol, vol.74, issue.2, pp.245-266, 2012. ,
The lasso problem and uniqueness, Electron. J. Stat, vol.7, pp.1456-1490, 2013. ,
Dykstra's Algorithm, ADMM, and Coordinate Descent: Connections, Insights, and Extensions, NIPS, pp.517-528, 2017. ,
Convergence of a block coordinate descent method for nondifferentiable minimization, J. Optim. Theory Appl, vol.109, issue.3, pp.475-494, 2001. ,
Model consistency of partly smooth regularizers, IEEE Trans. Inf. Theory, vol.64, issue.3, pp.1725-1737, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01658847
, Lasso screening rules via dual polytope projection, 2012.
Screening tests for lasso problems, IEEE Trans. Pattern Anal. Mach. Intell, p.99, 2016. ,
An improved GLMNET for l1-regularized logistic regression, J. Mach. Learn. Res, vol.13, 1999. ,
Model selection and estimation in regression with grouped variables, J. R. Stat. Soc. Ser. B Stat. Methodol, vol.68, issue.1, pp.49-67, 2006. ,