Algorithms for Fitting the Constrained Lasso
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Tutorial on the SWEEP Operator
- A generic path algorithm for regularized statistical estimation
- Degrees of freedom in lasso problems
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Estimation of the mean of a multivariate normal distribution
- Extended BIC for small-n-large-P sparse GLM
- Extended Bayesian information criteria for model selection with large model spaces
- Isotonic regression: Another look at the changepoint problem
- Least angle regression. (With discussion)
- Nonnegative-Lasso and application in index tracking
- On the ``degrees of freedom of the lasso
- Optimization
- Piecewise linear regularized solution paths
- Regression analysis for microbiome compositional data
- Sparsity and Smoothness Via the Fused Lasso
- Spatial smoothing and hot spot detection for CGH data using the fused lasso
- The dual and degrees of freedom of linearly constrained generalized Lasso
- The solution path of the generalized lasso
- Variable selection in regression with compositional covariates
- Variable selection via RIVAL (removing irrelevant variables amidst lasso iterations) and its application to nuclear material detection
- ggplot2. Elegant graphics for data analysis
Cited in
(41)- Proximal MCMC for Bayesian Inference of Constrained and Regularized Estimation
- Convergence rate of inexact augmented Lagrangian method with practical relative error criterion for composite convex programming
- Primal path algorithm for compositional data analysis
- On sparse ensemble methods: an application to short-term predictions of the evolution of COVID-19
- A Fast Solution to the Lasso Problem with Equality Constraints
- Penalized quasi-likelihood estimation and model selection with parameters on the boundary of the parameter space
- Mini-batch stochastic subgradient for functional constrained optimization
- Penalized polygram regression
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
- A primal-dual partial inverse algorithm for constrained monotone inclusions: applications to stochastic programming and mean field games
- An efficient first-order conditional gradient algorithm in data-driven sparse identification of nonlinear dynamics to solve sparse recovery problems under noise
- Fused Lasso nearly-isotonic signal approximation in general dimensions
- Coordinate descent algorithms for lasso penalized regression
- Solution paths for the generalized Lasso with applications to spatially varying coefficients regression
- Penalized and constrained LAD estimation in fixed and high dimension
- On a Frank-Wolfe approach for abs-smooth functions
- Interpretable Model Summaries Using the Wasserstein Distance
- Age-Coherent Mortality Modeling and Forecasting Using a Constrained Sparse Vector-Autoregressive Model
- Sparse regression for data-driven deterrence functions in gravity models
- Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method
- Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
- LASSO-pattern search algorithm with application to ophthalmology and genomic data
- Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning
- A cost-sensitive constrained Lasso
- Penalized and Constrained Optimization: An Application to High-Dimensional Website Advertising
- A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems
- On fair Lasso regression
- An integrated Bayesian framework for multi-omics prediction and classification
- Primal-dual incremental gradient method for nonsmooth and convex optimization problems
- A descent algorithm for constrained LAD-Lasso estimation with applications in portfolio selection
- Two Bayesian variable screening procedures
- A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems
- ConstrainedLasso
- Linear support vector regression with linear constraints
- A decomposition method for Lasso problems with zero-sum constraint
- The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results
- Efficient path algorithms for clustered Lasso and OSCAR
- Variance reduced moving balls approximation method for smooth constrained minimization problems
- Mean-variance efficient large portfolios: a simple machine learning heuristic technique based on the two-fund separation theorem
- Functional mixtures-of-experts
- Robust regression with compositional covariates
This page was built for publication: Algorithms for Fitting the Constrained Lasso
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3391167)
