A partially proximal linearized alternating minimization method for finding Dantzig selectors
From MaRDI portal
Recommendations
- The linearized alternating direction method of multipliers for Dantzig selector
- Finding Dantzig selectors with a proximity operator based fixed-point algorithm
- Variable selection and parameter estimation for partially linear models via Dantzig selector
- An alternating direction method for finding Dantzig selectors
- A fast splitting method tailored for Dantzig selector
Cites work
- A fast splitting method tailored for Dantzig selector
- An alternating direction method for finding Dantzig selectors
- Better Subset Regression Using the Nonnegative Garrote
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- DASSO: Connections Between the Dantzig Selector and Lasso
- Finding Dantzig selectors with a proximity operator based fixed-point algorithm
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Least angle regression. (With discussion)
- On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
- Preconditioning the Lasso for sign consistency
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Regularization and Variable Selection Via the Elastic Net
- Splitting methods for split feasibility problems with application to Dantzig selectors
- 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
(6)- Finding Dantzig selectors with a proximity operator based fixed-point algorithm
- An alternating direction method for finding Dantzig selectors
- The linearized alternating direction method of multipliers for Dantzig selector
- Nonconvex Dantzig selector and its parallel computing algorithm
- Feature splitting parallel algorithm for Dantzig selectors
- Robust penalized Dantzig selector: error analysis, oracle inequalities, and algorithmic efficiency
This page was built for publication: A partially proximal linearized alternating minimization method for finding Dantzig selectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1983897)
