Fetching the paper…
Reading the bibliography…
Sparse regression models are increasingly prevalent due to their ease of interpretability and superior out-of-sample performance.
Ridge regression: Biased estimation for nonorthogonal problems
Hoerl, A. E. and Kennard, R. W. (1970) · 1970
Earlier work this paper cites.
A statistical view of some chemometrics regression tools
Frank, L. E. and Friedman, J. H. (1993) · 1993
Earlier work this paper cites.
Sparse approximate solutions to linear systems
Natarajan, B. K. (1995) · 1995
Earlier work this paper cites.
Regression shrinkage and selection via the Lasso
Tibshirani, R. (1996) · 1996
Earlier work this paper cites.
Variable selection via nonconcave penalized likelihood and its oracle properties
Fan, J. and Li, R. (2001) · 2001
Earlier work this paper cites.
The elements of statistical learning: Data mining, inference, and prediction
Hastie, T., Tibshirani, R., and Friedman, J. (2001) · 2001
Earlier work this paper cites.
Subset selection in regression
Miller, A. (2002) · 2002
Earlier work this paper cites.
Least angle regression
Efron, B., Hastie, T., Johnstone, I., Tibshirani, R., et al. (2004) · 2004
Earlier work this paper cites.
2x2 convexifications for convex quadratic optimization with indicator variables
Han, S., Gómez, A., and Atamtürk, A. (2020) · 2004
Earlier work this paper cites.
Sparse regression at scale: Branch-and-bound rooted in first-order optimization
Hazimeh, H., Mazumder, R., and Saab, A. (2020) · 2004
Earlier work this paper cites.
Variable selection using MM algorithms
Hunter, D. R. and Li, R. (2005) · 2005
Earlier work this paper cites.
Sparsity and smoothness via the fused lasso
Tibshirani, R., Saunders, M., Rosset, S., Zhu, J., and Knight, K. (2005) · 2005
Earlier work this paper cites.
Regularization and variable selection via the elastic net
Zou, H. and Hastie, T. (2005) · 2005
Earlier work this paper cites.
Perspective cuts for a class of convex 0–1 mixed integer programs
Frangioni, A. and Gentile, C. (2006) · 2006
Earlier work this paper cites.
On model selection consistency of lasso
Zhao, P. and Yu, B. (2006) · 2006
Earlier work this paper cites.
The adaptive lasso and its oracle properties
Zou, H. (2006) · 2006
Earlier work this paper cites.
Cuts for conic mixed integer programming
Atamtürk, A. and Narayanan, V. (2007) · 2007
Earlier work this paper cites.
The sparsity and bias of the Lasso selection in high-dimensional linear regression
Zhang, C.-H., Huang, J., et al. (2008) · 2008
Earlier work this paper cites.
One-step sparse estimates in nonconcave penalized likelihood models
Zou, H. and Li, R. (2008) · 2008
Cited alongside, same era.
A strong conic quadratic reformulation for machine-job assignment with controllable processing times
Aktürk, M. S., Atamtürk, A., and Gürel, S. (2009) · 2009
Cited alongside, same era.
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Günlük, O. and Linderoth, J. (2010) · 2010
Cited alongside, same era.
Nearly unbiased variable selection under minimax concave penalty
Zhang, C.-H. et al. (2010) · 2010
Cited alongside, same era.
The smooth-lasso and other ℓ 1 \ell_{1} + ℓ 2 \ell_{2} -penalized methods
Hebiri, M., Van De Geer, S., et al. (2011) · 2011
Cited alongside, same era.
A practical scheme and fast algorithm to tune the lasso with optimality guarantees
Chichignoud, M., Lederer, J., and Wainwright, M. J. (2016) · 2016
Later among the works it cites.
Strong socp relaxations for the optimal power flow problem
Kocuk, B., Dey, S. S., and Sun, X. A. (2016) · 2016
Later among the works it cites.
Sparse high-dimensional regression: Exact scalable algorithms and phase transitions
Bertsimas, D. and Van Parys, B. (2017) · 2017
Later among the works it cites.
UCI machine learning repository
Dheeru, D. and Karra Taniskidou, E. (2017) · 2017
Later among the works it cites.
Extended comparisons of best subset selection, forward stepwise selection, and the lasso
Hastie, T., Tibshirani, R., and Tibshirani, R. J. (2017) · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Mazumder, R., Friedman, J. H., and Hastie, T. (2011) · 2011
Cited alongside, same era.
The solution path of the generalized lasso
Tibshirani, R. J. (2011) · 2011
Cited alongside, same era.
A brief history of linear and mixed-integer programming computation
Bixby, R. E. (2012) · 2012
Cited alongside, same era.
A general theory of concave regularization for high-dimensional sparse estimation problems
Zhang, C.-H., Zhang, T., et al. (2012) · 2012
Cited alongside, same era.
Learning surrogate models for simulation-based optimization
Cozad, A., Sahinidis, N. V., and Miller, D. C. (2014) · 2014
Cited alongside, same era.
Alternating linearization for structured regularization problems
Lin, X., Pham, M., and Ruszczyński, A. (2014) · 2014
Cited alongside, same era.
Lower bounds on the performance of polynomial-time algorithms for sparse linear regression
Zhang, Y., Wainwright, M. J., and Jordan, M. I. (2014) · 2014
Cited alongside, same era.
Quadratic cone cutting surfaces for quadratic programs with on–off constraints
Jeon, H., Linderoth, J., and Miller, A. (2017) · 2017
Later among the works it cites.
Subset selection with shrinkage: Sparse linear modeling when the SNR is low
Mazumder, R., Radchenko, P., and Dedieu, A. (2017) · 2017
Later among the works it cites.
Identifying a minimal class of models for high-dimensional data
Nevo, D. and Ritov, Y. (2017) · 2017
Later among the works it cites.
The dfs fused lasso: Linear-time denoising over general graphs
Padilla, O. H. M., Sharpnack, J., Scott, J. G., and Tibshirani, R. J. (2017) · 2017
Later among the works it cites.
Strong formulations for quadratic optimization with M-matrices and indicator variables
Atamtürk, A. and Gómez, A. (2018) · 2018
Later among the works it cites.
Sparse and smooth signal estimation: Convexification of ℓ 0 \ell_{0} formulations
Atamtürk, A., Gómez, A., and Han, S. (2018) · 2018
Later among the works it cites.
Strong formulations for conic quadratic optimization with indicator variables
Gómez, A. (2018) · 2018
Later among the works it cites.
Fast best subset selection: Coordinate descent and local combinatorial optimization algorithms
Hazimeh, H. and Mazumder, R. (2018) · 2018
Later among the works it cites.
A constructive approach to L0 penalized regression
Huang, J., Jiao, Y., Liu, Y., and Lu, X. (2018) · 2018
Later among the works it cites.
Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
Kocuk, B., Dey, S. S., and Sun, X. A. (2018) · 2018
Later among the works it cites.
Xie, W. and Deng, X. (2018) · 2018
Later among the works it cites.
Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs
Frangioni, A., Gentile, C., and Hungerford, J. (2020) · 2020
Closest in time.
A mixed-integer fractional optimization approach to best subset selection
Gómez, A. and Prokopyev, O. (2020) · 2020
Closest in time.