A unified consensus-based parallel algorithm for high-dimensional regression with combined regularizations
From MaRDI portal
Cites work
- A fast unified algorithm for solving group-lasso penalize learning problems
- A selective review of group selection in high-dimensional models
- ADMM for High-Dimensional Sparse Penalized Quantile Regression
- Alternating direction method of multipliers for machine learning
- Alternating direction method of multipliers for nonconvex fused regression problems
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- An Iterative Sparse-Group Lasso
- C-HiLasso: A Collaborative Hierarchical Sparse Modeling Framework
- Clusterwise support vector linear regression
- Comment: Ridge Regression—Still Inspiring After 50 Years
- Convex support vector regression
- De-noising by soft-thresholding
- Discerning the linear convergence of ADMM for structured convex optimization through the lens of variational analysis
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- General matching quantiles M-estimation
- scientific article; zbMATH DE number 1953444 (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
- Matching a distribution by matching quantiles estimation
- Model Selection and Estimation in Regression with Grouped Variables
- Multi-block alternating direction method of multipliers for ultrahigh dimensional quantile fused regression
- Nearly unbiased variable selection under minimax concave penalty
- Nonlinear total variation based noise removal algorithms
- Nonnegative adaptive Lasso for ultra-high dimensional regression models and a two-stage method applied in financial modeling
- Nonnegative-Lasso and application in index tracking
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the adaptive elastic net with a diverging number of parameters
- One-step sparse estimates in nonconcave penalized likelihood models
- Optimization
- Pathwise coordinate optimization
- Penalized and constrained LAD estimation in fixed and high dimension
- Penalized Quantile Regression for Distributed Big Data Using the Slack Variable Representation
- Piecewise linear regularized solution paths
- Regression Quantiles
- Regularization and Variable Selection Via the Elastic Net
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Robust Estimation of a Location Parameter
- Robust high dimensional learning for Lipschitz and convex losses
- Robust regression under the general framework of bounded loss functions
- Simultaneous feature selection and clustering based on square root optimization
- Sparsity and Smoothness Via the Fused Lasso
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- Strong oracle optimality of folded concave penalized estimation
- The Adaptive Lasso and Its Oracle Properties
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- The Group Square-Root Lasso: Theoretical Properties and Fast Algorithms
- The Mnet method for variable selection
- Variable selection via combined penalization for high-dimensional data analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(2)
This page was built for publication: A unified consensus-based parallel algorithm for high-dimensional regression with combined regularizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955433)
