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

Celý popis

Podrobná bibliografia

Vydané v:	AIMS mathematics Ročník 6; číslo 6; s. 6180 - 6200
Hlavní autori:	Hanjing, Adisak, Jailoka, Pachara, Suantai, Suthep
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	AIMS Press 01.01.2021
Predmet:	convex minimization problems forward-backward methods image restoration problems inertial techniques linesearches regression problems
ISSN:	2473-6988, 2473-6988
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!