Algorithms for Fitting the Constrained Lasso
From MaRDI portal
Publication:3391167
DOI10.1080/10618600.2018.1473777OpenAlexW2551219942WikidataQ90934907 ScholiaQ90934907MaRDI QIDQ3391167
Brian R. Gaines, Hua Zhou, Ju Hyun Kim
Publication date: 28 March 2022
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Full work available at URL: https://europepmc.org/articles/pmc6320228
convex optimizationlinear constraintsalternating direction method of multiplierspenalized regressionregularization pathgeneralized Lasso
Related Items
A descent algorithm for constrained LAD-Lasso estimation with applications in portfolio selection, Penalized and constrained LAD estimation in fixed and high dimension, Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method, ConstrainedLasso, Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning, Primal path algorithm for compositional data analysis, A primal-dual partial inverse algorithm for constrained monotone inclusions: applications to stochastic programming and mean field games, A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems, Sparse regression for data-driven deterrence functions in gravity models, A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems, On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming, Primal-dual incremental gradient method for nonsmooth and convex optimization problems, Penalized and Constrained Optimization: An Application to High-Dimensional Website Advertising, On sparse ensemble methods: an application to short-term predictions of the evolution of COVID-19, Robust regression with compositional covariates, Solution paths for the generalized Lasso with applications to spatially varying coefficients regression, Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets, A cost-sensitive constrained Lasso, Linear support vector regression with linear constraints, A decomposition method for Lasso problems with zero-sum constraint, Penalized polygram regression, Age-Coherent Mortality Modeling and Forecasting Using a Constrained Sparse Vector-Autoregressive Model
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Variable selection in regression with compositional covariates
- Regression analysis for microbiome compositional data
- Degrees of freedom in lasso problems
- The solution path of the generalized lasso
- Estimation of the mean of a multivariate normal distribution
- Nonnegative-Lasso and application in index tracking
- The dual and degrees of freedom of linearly constrained generalized Lasso
- Least angle regression. (With discussion)
- Variable selection via RIVAL (removing irrelevant variables amidst lasso iterations) and its application to nuclear material detection
- On the ``degrees of freedom of the lasso
- Piecewise linear regularized solution paths
- Isotonic regression: Another look at the changepoint problem
- Extended BIC for small-n-large-P sparse GLM
- Extended Bayesian information criteria for model selection with large model spaces
- Spatial smoothing and hot spot detection for CGH data using the fused lasso
- A Tutorial on the SWEEP Operator
- Sparsity and Smoothness Via the Fused Lasso
- A Generic Path Algorithm for Regularized Statistical Estimation
- Optimization