A fast splitting method tailored for Dantzig selector
From MaRDI portal
Recommendations
- The linearized alternating direction method of multipliers for Dantzig selector
- Splitting methods for split feasibility problems with application to Dantzig selectors
- Finding Dantzig selectors with a proximity operator based fixed-point algorithm
- An alternating direction method for finding Dantzig selectors
- Efficient sparse Hessian-based semismooth Newton algorithms for Dantzig selector
Cites work
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Alternating direction method for covariance selection models
- Alternating direction method for image inpainting in wavelet domains
- An alternating direction method for finding Dantzig selectors
- Better Subset Regression Using the Nonnegative Garrote
- DASSO: Connections Between the Dantzig Selector and Lasso
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Least angle regression. (With discussion)
- Matrix completion via an alternating direction method
- Multiplier and gradient methods
- Primal-dual first-order methods for a class of cone programming
- Regularization and Variable Selection Via the Elastic Net
- Solving large-scale least squares semidefinite programming by alternating direction methods
- Templates for convex cone problems with applications to sparse signal recovery
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The linearized alternating direction method of multipliers for Dantzig selector
- Variable selection and dependency networks for genomewide data
Cited in
(11)- A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming
- On the convergence rate of the augmented Lagrangian-based parallel splitting method
- Splitting methods for split feasibility problems with application to Dantzig selectors
- The linearized alternating direction method of multipliers for Dantzig selector
- On globally Q-linear convergence of a splitting method for group Lasso
- A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems
- A partially proximal linearized alternating minimization method for finding Dantzig selectors
- Nonconvex Dantzig selector and its parallel computing algorithm
- Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems
- Metric selection in fast dual forward-backward splitting
- Efficient sparse Hessian-based semismooth Newton algorithms for Dantzig selector
This page was built for publication: A fast splitting method tailored for Dantzig selector
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q887167)
