On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
From MaRDI portal
(Redirected from Publication:457540)
Recommendations
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization
- scientific article; zbMATH DE number 7404502
- A modified proximal gradient method for a family of nonsmooth convex optimization problems
- A modified proximal gradient method and its convergence rate
- On the proximal Landweber Newton method for a class of nonsmooth convex problems
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A coordinate gradient descent method for nonsmooth separable minimization
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Consistency of the group Lasso and multiple kernel learning
- Convex Analysis
- Introductory lectures on convex optimization. A basic course.
- Model Selection and Estimation in Regression with Grouped Variables
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Regularization and Variable Selection Via the Elastic Net
- Signal Recovery by Proximal Forward-Backward Splitting
- Sparse Reconstruction by Separable Approximation
- Sparse group Lasso and high dimensional multinomial classification
- The Adaptive Lasso and Its Oracle Properties
- The Group Lasso for Logistic Regression
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(32)- scientific article; zbMATH DE number 7404502 (Why is no real title available?)
- Newton-type methods with the proximal gradient step for sparse estimation
- A parallel line search subspace correction method for composite convex optimization
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity
- On the proximal Landweber Newton method for a class of nonsmooth convex problems
- On convergence analysis of dual proximal-gradient methods with approximate gradient for a class of nonsmooth convex minimization problems
- scientific article; zbMATH DE number 6453672 (Why is no real title available?)
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- scientific article; zbMATH DE number 7753349 (Why is no real title available?)
- ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
- A modified proximal gradient method and its convergence rate
- The forward-backward splitting method and its convergence rate for the minimization of the sum of two functions in Banach spaces
- On globally Q-linear convergence of a splitting method for group Lasso
- On the linear convergence of the alternating direction method of multipliers
- A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- A globally convergent proximal Newton-type method in nonsmooth convex optimization
- Optimal portfolio selections via \(\ell_{1, 2}\)-norm regularization
- Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM
- Nonconvex proximal incremental aggregated gradient method with linear convergence
- A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems
- A unified approach to error bounds for structured convex optimization problems
- Proximal gradient method with automatic selection of the parameter by automatic differentiation
- On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization
- Iteration complexity analysis of block coordinate descent methods
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems
- A block successive upper-bound minimization method of multipliers for linearly constrained convex optimization
- A modified proximal gradient method for a family of nonsmooth convex optimization problems
- A proximal sub-gradient method for group Lasso-type problems
- Decomposable norm minimization with proximal-gradient homotopy algorithm
This page was built for publication: On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q457540)
