Smoothing proximal gradient method for general structured sparse regression
From MaRDI portal
Publication:439167
DOI10.1214/11-AOAS514zbMath1243.62100arXiv1005.4717MaRDI QIDQ439167
Xi Chen, Qihang Lin, Seyoung Kim, Jaime G. Carbonell, Eric P. Xing
Publication date: 1 August 2012
Published in: The Annals of Applied Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1005.4717
Related Items
FACTORISABLE MULTITASK QUANTILE REGRESSION, An Efficient Algorithm for Minimizing Multi Non-Smooth Component Functions, Structured sparsity through convex optimization, Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method, Penalized Estimation of Frailty-Based Illness–Death Models for Semi-Competing Risks, It's All Relative: Regression Analysis with Compositional Predictors, A Joint Fairness Model with Applications to Risk Predictions for Underrepresented Populations, Heterogeneous Mediation Analysis on Epigenomic PTSD and Traumatic Stress in a Predominantly African American Cohort, Regularized regression when covariates are linked on a network: the 3CoSE algorithm, Truncated estimation in functional generalized linear regression models, Proximal methods for the latent group lasso penalty, Regularization-based model tree for multi-output regression, Point process estimation with Mirror Prox algorithms, Selective linearization for multi-block statistical learning, Sparse group fused Lasso for model segmentation: a hybrid approach, Network classification with applications to brain connectomics, PAC-Bayesian risk bounds for group-analysis sparse regression by exponential weighting, A smoothing stochastic gradient method for composite optimization, Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Reconstructing DNA copy number by penalized estimation and imputation
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- The solution path of the generalized lasso
- A quasi-Newton acceleration for high-dimensional optimization algorithms
- The composite absolute penalties family for grouped and hierarchical variable selection
- A feasible semismooth asymptotically Newton method for mixed complementarity problems
- A nonsmooth version of Newton's method
- Pathwise coordinate optimization
- Coordinate descent algorithms for lasso penalized regression
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Sparsity and Smoothness Via the Fused Lasso
- Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis
- Model Selection and Estimation in Regression with Grouped Variables