A highly efficient algorithm for solving exclusive lasso problems
From MaRDI portal
Publication:6640992
Recommendations
- Within group variable selection through the exclusive Lasso
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- Efficient sparse semismooth Newton methods for the clustered Lasso problem
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- Efficient sparse Hessian-based semismooth Newton algorithms for Dantzig selector
Cites work
- scientific article; zbMATH DE number 4082855 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A nonsmooth version of Newton's method
- A unified approach to error bounds for structured convex optimization problems
- An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
- Bregman proximal point algorithm revisited: a new inexact version and its inertial variant
- Hankel matrix rank minimization with applications to system identification and realization
- Model Selection and Estimation in Regression with Grouped Variables
- Modeling Financial Time Series with S-PLUS®
- Monotone Operators and the Proximal Point Algorithm
- Newton and quasi-Newton methods for normal maps with polyhedral sets
- On efficiently solving the subproblems of a level-set method for fused lasso problems
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Proximité et dualité dans un espace hilbertien
- Semismooth Matrix-Valued Functions
- Semismooth and Semiconvex Functions in Constrained Optimization
- Some continuity properties of polyhedral multifunctions
- Sparse regression using mixed norms
- Templates for convex cone problems with applications to sparse signal recovery
- Within group variable selection through the exclusive Lasso
This page was built for publication: A highly efficient algorithm for solving exclusive lasso problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6640992)
