A proximal sub-gradient method for group Lasso-type problems
From MaRDI portal
(Redirected from A proximal sub-gradient method for group Lasso-type problems)
Recommendations
- On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
- scientific article; zbMATH DE number 7404502
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- LARS-type algorithm for group Lasso
- Proximal methods for the latent group lasso penalty
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Accelerated Uzawa methods for convex optimization
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Consistency of the group Lasso and multiple kernel learning
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
- On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
- Spectral regularization algorithms for learning large incomplete matrices
Cited in
(2)
This page was built for publication: A proximal sub-gradient method for group Lasso-type problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665217)
