Pages that link to "Item:Q5347971"
From MaRDI portal
The following pages link to The Discrete Dantzig Selector: Estimating Sparse Linear Models via Mixed Integer Linear Optimization (Q5347971):
Displaying 12 items.
- Robust subset selection (Q2076115) (← links)
- Matrix completion with nonconvex regularization: spectral operators and scalable algorithms (Q2195855) (← links)
- Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor (Q2633546) (← links)
- Graph structured sparse subset selection (Q2662712) (← links)
- Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression (Q2687439) (← links)
- A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure (Q5086011) (← links)
- Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA (Q5095184) (← links)
- Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms (Q5144778) (← links)
- Scalable Algorithms for the Sparse Ridge Regression (Q5148400) (← links)
- The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty (Q5162621) (← links)
- Grouped variable selection with discrete optimization: computational and statistical perspectives (Q6046300) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
