Feature splitting parallel algorithm for Dantzig selectors

DOI10.1007/S11222-025-10658-YMaRDI QIDQ6961484zbMATH OpenFDO

Authors Xiaofei Wu, Yue Chao, Rongmei Liang, Shi Tang, Zhimin Zhang

Publication date 10 July 2025

Published in Statistics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11222-025-10658-Y

zbMATH Keywords

Dantzig selectorfeature splittingparallel computingpartition-insensitiveproximal point algorithm

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cites work

• A class of ADMM-based algorithms for three-block separable convex programming
• A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A fast splitting method tailored for Dantzig selector
• A first-order primal-dual algorithm for convex problems with applications to imaging
• A partially proximal linearized alternating minimization method for finding Dantzig selectors
• A proximal point algorithm revisit on the alternating direction method of multipliers
• A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming
• A unified consensus-based parallel algorithm for high-dimensional regression with combined regularizations
• ADMM for High-Dimensional Sparse Penalized Quantile Regression
• Alternating direction method of multipliers for machine learning
• An alternating direction method for finding Dantzig selectors
• Asset splitting algorithm for ultrahigh dimensional portfolio selection and its theoretical property
• Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
• Dantzig-type penalization for multiple quantile regression with high dimensional covariates
• DASSO: Connections Between the Dantzig Selector and Lasso
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Efficient sparse Hessian-based semismooth Newton algorithms for Dantzig selector
• Feature-splitting algorithms for ultrahigh dimensional quantile regression
• Finding Dantzig selectors with a proximity operator based fixed-point algorithm
• Forward regression for ultra-high dimensional variable screening
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 6472991 (Why is no real title available?)
• Linearized alternating direction method of multipliers for sparse group and fused Lasso models
• Multi-block alternating direction method of multipliers for ultrahigh dimensional quantile fused regression
• Multi-block linearized alternating direction method for sparse fused Lasso modeling problems
• Nearly unbiased variable selection under minimax concave penalty
• Nonconvex Dantzig selector and its parallel computing algorithm
• On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
• One-step sparse estimates in nonconcave penalized likelihood models
• Optimally linearizing the alternating direction method of multipliers for convex programming
• Parallelism, uniqueness, and large-sample asymptotics for the Dantzig selector
• Penalized Quantile Regression for Distributed Big Data Using the Slack Variable Representation
• Regularized Linear Programming Discriminant Rule with Folded Concave Penalty for Ultrahigh-Dimensional Data
• Simultaneous analysis of Lasso and Dantzig selector
• Splitting methods for split feasibility problems with application to Dantzig selectors
• Templates for convex cone problems with applications to sparse signal recovery
• The Adaptive Lasso and Its Oracle Properties
• The Dantzig selector for censored linear regression models
• The Dantzig selector: recovery of signal via ℓ ₁ − αℓ ₂ minimization
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
• The linearized alternating direction method of multipliers for Dantzig selector
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

This page was built for publication: Feature splitting parallel algorithm for Dantzig selectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6961484)