A proximal-gradient method for problems with overlapping group-sparse regularization: support identification complexity

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Proximal methods for the latent group lasso penalty
On the convergence properties of the projected gradient method for convex optimization
Error bounds for analytic systems and their applications
Introductory lectures on convex optimization. A basic course.
Templates for convex cone problems with applications to sparse signal recovery
Descentwise inexact proximal algorithms for smooth optimization
Block-based refitting in \(\ell_{12}\) sparse regularization
Inexact first-order primal-dual algorithms
``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
Inexact successive quadratic approximation for regularized optimization
Accelerated and inexact forward-backward algorithms
Optimization with sparsity-inducing penalties
Activity Identification and Local Linear Convergence of Forward--Backward-type Methods
Monotone Operators and the Proximal Point Algorithm
Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice
First-Order Methods in Optimization
A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer
Regularization and Variable Selection Via the Elastic Net
Model Selection and Estimation in Regression with Grouped Variables
Classification of gene microarrays by penalized logistic regression
A fast unified algorithm for solving group-lasso penalize learning problems

This page was built for publication: A proximal-gradient method for problems with overlapping group-sparse regularization: support identification complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6641006)