A modified proximal gradient method for a family of nonsmooth convex optimization problems

DOI10.1007/s40305-017-0155-5zbMath1394.90461OpenAlexW2594900731MaRDI QIDQ1697903

Ying-Yi Li, Hai-Bin Zhang, Fei Li

Publication date: 20 February 2018

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-017-0155-5

zbMATH Keywords

nonsmooth convex optimizationQ-linear convergencemodified proximal gradient method

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items

Proximal gradient method with automatic selection of the parameter by automatic differentiation ⋮ A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration

Uses Software

• SLEP
• msgl

Cites Work

• Unnamed Item
• Unnamed Item
• On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Introductory lectures on convex optimization. A basic course.
• Sparse group Lasso and high dimensional multinomial classification
• On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
• Forward–backward-based descent methods for composite variational inequalities
• On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
• Variational Analysis
• Sparse Reconstruction by Separable Approximation
• Model Selection and Estimation in Regression with Grouped Variables
• Signal Recovery by Proximal Forward-Backward Splitting