The Discrete Dantzig Selector: Estimating Sparse Linear Models via Mixed Integer Linear Optimization
From MaRDI portal
Publication:5347971
zbMath1368.94035arXiv1508.01922MaRDI QIDQ5347971
Peter Radchenko, Rahul Mazumder
Publication date: 25 August 2017
Full work available at URL: https://arxiv.org/abs/1508.01922
Mixed integer programming (90C11) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor ⋮ A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure ⋮ Graph structured sparse subset selection ⋮ Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA ⋮ Grouped variable selection with discrete optimization: computational and statistical perspectives ⋮ Matrix completion with nonconvex regularization: spectral operators and scalable algorithms ⋮ Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression ⋮ Scalable Algorithms for the Sparse Ridge Regression ⋮ The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty ⋮ Robust subset selection ⋮ Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms
