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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	AIMS mathematics Jg. 6; H. 6; S. 6180 - 6200
Hauptverfasser:	Hanjing, Adisak, Jailoka, Pachara, Suantai, Suthep
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	AIMS Press 01.01.2021
Schlagworte:	convex minimization problems forward-backward methods image restoration problems inertial techniques linesearches regression problems
ISSN:	2473-6988, 2473-6988
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!