Efficient block-coordinate descent algorithms for the group Lasso
From MaRDI portal
Publication:2392933
DOI10.1007/S12532-013-0051-XzbMATH Open1275.90059OpenAlexW2117575248MaRDI QIDQ2392933FDOQ2392933
Recommendations
- Group coordinate descent algorithms for nonconvex penalized regression
- Coordinate descent algorithms for lasso penalized regression
- LARS-type algorithm for group Lasso
- A fast unified algorithm for solving group-lasso penalize learning problems
- Sparse optimization for nonconvex group penalized estimation
Cites Work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A coordinate gradient descent method for nonsmooth separable minimization
- Benchmarking optimization software with performance profiles.
- Compressed sensing
- Computing a Trust Region Step
- Consistency of the group Lasso and multiple kernel learning
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Model Selection and Estimation in Regression with Grouped Variables
- Numerical Optimization
- Regularization and Variable Selection Via the Elastic Net
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse Optimization with Least-Squares Constraints
- Sparse Reconstruction by Separable Approximation
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
- Tackling box-constrained optimization via a new projected quasi-Newton approach
- The Group Lasso for Logistic Regression
- Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
Cited In (39)
- Separable approximations and decomposition methods for the augmented Lagrangian
- LASSO for streaming data with adaptative filtering
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
- Block layer decomposition schemes for training deep neural networks
- Hybrid safe-strong rules for efficient optimization in Lasso-type problems
- Inexact coordinate descent: complexity and preconditioning
- Smoothing composite proximal gradient algorithm for sparse group Lasso problems with nonsmooth loss functions
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- On the proximal Landweber Newton method for a class of nonsmooth convex problems
- Group coordinate descent algorithms for nonconvex penalized regression
- An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization
- A flexible coordinate descent method
- Spatially multi-scale dynamic factor modeling via sparse estimation
- Practical inexact proximal quasi-Newton method with global complexity analysis
- Locally Sparse Function-on-Function Regression
- Iteration complexity of a block coordinate gradient descent method for convex optimization
- Proximal methods for the latent group lasso penalty
- On the complexity analysis of randomized block-coordinate descent methods
- Parallel block coordinate minimization with application to group regularized regression
- Ontology sparse vector learning algorithm for ontology similarity measuring and ontology mapping via ADAL technology
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- Title not available (Why is no real title available?)
- A randomized nonmonotone block proximal gradient method for a class of structured nonlinear programming
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Sparse optimization for nonconvex group penalized estimation
- Split Bregman algorithms for multiple measurement vector problem
- Block coordinate descent algorithms for large-scale sparse multiclass classification
- An alternating direction method for total variation denoising
- Monitoring of group-structured high-dimensional processes via sparse group Lasso
- Structured variable selection for regularized generalized canonical correlation analysis
- Group sparse optimization for learning predictive state representations
- Enhanced joint sparsity via iterative support detection
- The Group Lasso for Stable Recovery of Block-Sparse Signal Representations
- Linearly-convergent FISTA variant for composite optimization with duality
- Iterative rank-one matrix completion via singular value decomposition and nuclear norm regularization
- Varying coefficient linear discriminant analysis for dynamic data
- Empirical risk minimization: probabilistic complexity and stepsize strategy
- Random block coordinate descent methods for linearly constrained optimization over networks
- Randomness and permutations in coordinate descent methods
This page was built for publication: Efficient block-coordinate descent algorithms for the group Lasso
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392933)
