On Bernoulli's numerical solution of algebraic equations, Proceedings of the Royal Society of Edinburgh, vol.46, pp.289-305, 1926. ,
Iterative procedures for nonlinear integral equations, Journal of the ACM, 1965. ,
Convex optimization with sparsity-inducing norms. Foundations and Trends in Machine Learning, vol.4, pp.1-106, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00937150
First-Order Methods in Optimization, 2017. ,
, The best of both worlds. Computing in Science Engineering, vol.13, pp.31-39, 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
A dynamic screening principle for the lasso, EUSIPCO, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00880787
Extrapolating to the limit of a vector sequence, Information Linkage between Applied Mathematics and Industry, 1979. ,
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. ,
Mind the duality gap: safer rules for the lasso, ICML, 2015. ,
Accelerated, parallel and proximal coordinate descent, SIAM J. Optim, vol.25, issue.3, pp.1997-2013, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-02287265
Pathwise coordinate optimization, Ann. Appl. Stat, vol.1, issue.2, pp.302-332, 2007. ,
Fixed-point continuation for 1-minimization: Methodology and convergence, SIAM J. Optim, vol.19, issue.3, pp.1107-1130, 2008. ,
QUIC: Quadratic approximation for sparse inverse covariance estimation, J. Mach. Learn. Res, vol.15, pp.2911-2947, 2014. ,
Blitz: A principled metaalgorithm for scaling sparse optimization, ICML, pp.1171-1179, 2015. ,
A fast, principled working set algorithm for exploiting piecewise linear structure in convex problems, 2018. ,
An interior-point method for large-scale 1-regularized logistic regression, J. Mach. Learn. Res, vol.8, issue.8, pp.1519-1555, 2007. ,
Proximal Newton-type methods for convex optimization, NIPS, 2012. ,
Sparse coding for machine learning, image processing and computer vision, 2010. ,
From safe screening rules to working sets for faster lasso-type solvers, NIPS-OPT, 2017. ,
Celer: a fast solver for the Lasso with dual extrapolation, ICML, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01833398
Gap safe screening rules for sparsity enforcing penalties, J. Mach. Learn. Res, vol.18, issue.128, pp.1-33, 2017. ,
Joint covariate selection and subspace selection for multiple classification problems, Statistics and Computing, vol.20, issue.2, pp.231-252, 2010. ,
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
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. ,
Convergence of a block coordinate descent method for nondifferentiable minimization, J. Optim. Theory Appl, vol.109, issue.3, pp.475-494, 2001. ,
, Lasso screening rules via dual polytope projection, 2012.
Screening tests for lasso problems, IEEE Trans. Pattern Anal. Mach. Intell, p.99, 2016. ,
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. ,