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

Published in:	AIMS mathematics Vol. 6; no. 6; pp. 6180 - 6200
Main Authors:	Hanjing, Adisak, Jailoka, Pachara, Suantai, Suthep
Format:	Journal Article
Language:	English
Published:	AIMS Press 01.01.2021
Subjects:	convex minimization problems forward-backward methods image restoration problems inertial techniques linesearches regression problems
ISSN:	2473-6988, 2473-6988
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!