On the convergence of the forward–backward splitting method with linesearches

From MaRDI portal
Publication:2829582

DOI10.1080/10556788.2016.1214959zbMATH Open1354.65116arXiv1501.02501OpenAlexW2513710035MaRDI QIDQ2829582FDOQ2829582

T. T. A. Nghia, J. Y. Bello Cruz

Publication date: 8 November 2016

Published in: Optimization Methods \& Software (Search for Journal in Brave)

Abstract: In this paper we focus on the convergence analysis of the forward-backward splitting method for solving nonsmooth optimization problems in Hilbert spaces when the objective function is the sum of two convex functions. Assuming that one of the functions is Fr'echet differentiable and using two new linesearches, the weak convergence is established without any Lipschitz continuity assumption on the gradient. Furthermore, we obtain many complexity results of cost values at the iterates when the stepsizes are bounded below by a positive constant.


Full work available at URL: https://arxiv.org/abs/1501.02501





Cites Work


Cited In (48)






This page was built for publication: On the convergence of the forward–backward splitting method with linesearches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829582)