Pages that link to "Item:Q457540"
From MaRDI portal
The following pages link to On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems (Q457540):
Displayed 19 items.
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization (Q489108) (← links)
- Decomposable norm minimization with proximal-gradient homotopy algorithm (Q513723) (← links)
- On the linear convergence of the alternating direction method of multipliers (Q517301) (← links)
- Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
- On globally Q-linear convergence of a splitting method for group Lasso (Q1656198) (← links)
- A unified approach to error bounds for structured convex optimization problems (Q1675267) (← links)
- A modified proximal gradient method for a family of nonsmooth convex optimization problems (Q1697903) (← links)
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property (Q1739040) (← links)
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems (Q2022292) (← links)
- The forward-backward splitting method and its convergence rate for the minimization of the sum of two functions in Banach spaces (Q2037899) (← links)
- Optimal portfolio selections via \(\ell_{1, 2}\)-norm regularization (Q2057226) (← links)
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems (Q2070400) (← links)
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems (Q2288192) (← links)
- On the proximal Landweber Newton method for a class of nonsmooth convex problems (Q2340491) (← links)
- A parallel line search subspace correction method for composite convex optimization (Q2516372) (← links)
- A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization (Q3387904) (← links)
- Proximal gradient method with automatic selection of the parameter by automatic differentiation (Q4685565) (← links)
- A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure (Q5086011) (← links)
- A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems (Q6111345) (← links)