An accelerated forward-backward algorithm with a new linesearch for convex minimization problems and its applications

An accelerated forward-backward algorithm with a new linesearch for convex minimization problems and its applications

We study and investigate a convex minimization problem of the sum of two convex functions in the setting of a Hilbert space. By assuming the Lipschitz continuity of the gradient of the function, many optimization methods have been invented, where the stepsizes of those algorithms depend on the Lipsc...

Full description

Bibliographic Details
Main Authors: Adisak Hanjing, Pachara Jailoka, Suthep Suantai
Format: Article
Language:English
Published: AIMS Press 2021-04-01
Series:AIMS Mathematics
Subjects:
convex minimization problems
forward-backward methods
linesearches
inertial techniques
image restoration problems
regression problems
Online Access:https://www.aimspress.com/article/doi/10.3934/math.2021363?viewType=HTML

Internet

https://www.aimspress.com/article/doi/10.3934/math.2021363?viewType=HTML

Similar Items