DASSO: Connections Between the Dantzig Selector and Lasso
From MaRDI portal
Publication:3551034
DOI10.1111/J.1467-9868.2008.00668.XzbMath1231.62129OpenAlexW2138170572MaRDI QIDQ3551034
Peter Radchenko, Gareth M. James, Jinchi Lv
Publication date: 8 April 2010
Published in: Journal of the Royal Statistical Society Series B: Statistical Methodology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1467-9868.2008.00668.x
Related Items (42)
On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions ⋮ An extended variable inclusion and shrinkage algorithm for correlated variables ⋮ A linear programming model for selection of sparse high-dimensional multiperiod portfolios ⋮ Bridge Estimators in the Partially Linear Model with High Dimensionality ⋮ Functional linear regression that's interpretable ⋮ A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints ⋮ Finding Dantzig selectors with a proximity operator based fixed-point algorithm ⋮ An alternating direction method for finding Dantzig selectors ⋮ A fast splitting method tailored for Dantzig selector ⋮ Framework for segmented threshold \(\ell_0\) gradient approximation based network for sparse signal recovery ⋮ Bridge estimators and the adaptive Lasso under heteroscedasticity ⋮ Non-asymptotic oracle inequalities for the Lasso and Group Lasso in high dimensional logistic model ⋮ Manifold elastic net: a unified framework for sparse dimension reduction ⋮ Adaptive Lasso and Dantzig selector for spatial point processes intensity estimation ⋮ Variable selection and parameter estimation for partially linear models via Dantzig selector ⋮ High-dimensional semiparametric Gaussian copula graphical models ⋮ GRID: a variable selection and structure discovery method for high dimensional nonparametric regression ⋮ A LINEAR-PROGRAMMING PORTFOLIO OPTIMIZER TO MEAN–VARIANCE OPTIMIZATION ⋮ Statistical multiresolution Dantzig estimation in imaging: fundamental concepts and algorithmic framework ⋮ The solution path of the generalized lasso ⋮ Transductive versions of the Lasso and the Dantzig selector ⋮ Comment: Boosting algorithms: regularization, prediction and model fitting ⋮ A new variable selection method for uniform designs ⋮ On Dantzig and Lasso estimators of the drift in a high dimensional Ornstein-Uhlenbeck model ⋮ Normalized and standard Dantzig estimators: two approaches ⋮ Penalized and Constrained Optimization: An Application to High-Dimensional Website Advertising ⋮ A partially proximal linearized alternating minimization method for finding Dantzig selectors ⋮ Consistent High-Dimensional Bayesian Variable Selection via Penalized Credible Regions ⋮ Templates for convex cone problems with applications to sparse signal recovery ⋮ Complexity and applications of the homotopy principle for uniformly constrained sparse minimization ⋮ Enhanced ridge regressions ⋮ A unified approach to model selection and sparse recovery using regularized least squares ⋮ Bayesian variable selection with shrinking and diffusing priors ⋮ Regularized rank-based estimation of high-dimensional nonparanormal graphical models ⋮ Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals ⋮ High-dimensional regression in practice: an empirical study of finite-sample prediction, variable selection and ranking ⋮ Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies ⋮ Tuning Parameter Estimation in Penalized Least Squares Methodology ⋮ Damage identification in bridge structures subject to moving vehicle based on extended Kalman filter with l1-norm regularization ⋮ Parallelism, uniqueness, and large-sample asymptotics for the Dantzig selector ⋮ The Penalized Analytic Center Estimator ⋮ Efficient Sparse Hessian-Based Semismooth Newton Algorithms for Dantzig Selector
Cites Work
- Unnamed Item
- Unnamed Item
- The Adaptive Lasso and Its Oracle Properties
- A simple proof of the restricted isometry property for random matrices
- Simultaneous analysis of Lasso and Dantzig selector
- High-dimensional graphs and variable selection with the Lasso
- Piecewise linear regularized solution paths
- Better Subset Regression Using the Nonnegative Garrote
- Stable recovery of sparse overcomplete representations in the presence of noise
- On Polar Polytopes and the Recovery of Sparse Representations
- A generalized Dantzig selector with shrinkage tuning
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Adaptive Model Selection
- Regularization and Variable Selection Via the Elastic Net
This page was built for publication: DASSO: Connections Between the Dantzig Selector and Lasso
