Proximal type algorithms involving linesearch and inertial technique for split variational inclusion problem in hilbert spaces with applications

Abstract

ABSTRACTIn convex optimization, numerous problems in applied sciences can be modelled as the split variational inclusion problem (SVIP). In this connection, we aim to design new and efficient proximal type algorithms which are based on the inertial technique and the linesearches terminology. We then discuss its convergence under some suitable conditions without the assumption on the operator norm. We also apply our main result to the split minimization problem, the split feasibility problem, the relaxed split feasibility problem and the linear inverse problem. Finally, we provide some numerical experiments and comparisons to these problems. The obtained result mainly improves the recent results investigated by Chuang.