Inertial relaxed CQ algorithms for solving a split feasibility problem in Hilbert spaces

The split feasibility problem is to find a point x∗ with the property that x∗∈ C and Ax∗∈ Q, where C and Q are nonempty closed convex subsets of real Hilbert spaces X and Y, respectively, and A is a bounded linear operator from X to Y. The split feasibility problem models inverse problems arising from phase retrieval problems and the intensity-modulated radiation therapy. In this paper, we introduce a new inertial relaxed CQ algorithm for solving the split feasibility problem in real Hilbert spaces and establish weak convergence of the proposed CQ algorithm under certain mild conditions. Our result is a significant improvement of the recent results related to the split feasibility problem.

[1]  Y. J. Cho,et al.  MiKM: multi-step inertial Krasnosel’skiǐ–Mann algorithm and its applications , 2019, J. Glob. Optim..

[2]  Ravi P. Agarwal,et al.  Fixed Point Theory for Lipschitzian-type Mappings with Applications , 2009 .

[3]  P. Kumam,et al.  Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization , 2019, Journal of Inequalities and Applications.

[4]  Yeol Je Cho,et al.  Some Results for Split Equality Equilibrium Problems in Banach Spaces , 2019, Symmetry.

[5]  D. R. Sahu,et al.  Convergence of Inexact Mann Iterations Generated by Nearly Nonexpansive Sequences and Applications , 2016 .

[6]  P. Maingé.  Inertial Iterative Process for Fixed Points of Certain Quasi-nonexpansive Mappings , 2007 .

[7]  Fenghui Wang,et al.  Polyak’s gradient method for split feasibility problem constrained by level sets , 2018, Numerical Algorithms.

[8]  Yekini Shehu,et al.  New inertial relaxed method for solving split feasibilities , 2020, Optimization Letters.

[9]  Jie Sun,et al.  Inertial accelerated algorithms for solving a split feasibility problem , 2016 .

[10]  Boris Polyak.  Some methods of speeding up the convergence of iteration methods , 1964 .

[11]  Vu Tien Dung,et al.  A new self-adaptive CQ algorithm with an application to the LASSO problem , 2018, Journal of Fixed Point Theory and Applications.

[12]  P. Cholamjiak,et al.  Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems , 2018, Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas.

[13]  Prasit Cholamjiak,et al.  On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem , 2019, Numerical Algorithms.

[14]  R. Tibshirani.  Regression Shrinkage and Selection via the Lasso , 1996 .

[15]  Yeol Je Cho,et al.  On solving proximal split feasibility problems and applications , 2017 .

[16]  Y. J. Cho,et al.  “Optimal” choice of the step length of the projection and contraction methods for solving the split feasibility problem , 2018, J. Glob. Optim..

[17]  R. Rockafellar.  Monotone Operators and the Proximal Point Algorithm , 1976 .

[18]  Yair Censor,et al.  A multiprojection algorithm using Bregman projections in a product space , 1994, Numerical Algorithms.

[19]  Y. Cho,et al.  A General Algorithm for the Split Common Fixed Point Problem with Its Applications to Signal Processing , 2019, Mathematics.

[20]  P. Cholamjiak,et al.  A New CQ Algorithm for Solving Split Feasibility Problems in Hilbert Spaces , 2019 .

[21]  Hong-Kun Xu,et al.  Solving the split feasibility problem without prior knowledge of matrix norms , 2012 .

[22]  Yonghong Yao,et al.  Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces , 2014, Optim. Lett..

[23]  Y. Cho,et al.  General Inertial Mann Algorithms and Their Convergence Analysis for Nonexpansive Mappings , 2018 .

[24]  Qamrul Hasan Ansari,et al.  Split Feasibility and Fixed Point Problems , 2014 .

[25]  Binghua Liu,et al.  The Split Feasibility Problem and Its Solution Algorithm , 2018 .

[26]  Heinz H. Bauschke,et al.  Convex Analysis and Monotone Operator Theory in Hilbert Spaces , 2011, CMS Books in Mathematics.

[27]  H. Attouch,et al.  An Inertial Proximal Method for Maximal Monotone Operators via Discretization of a Nonlinear Oscillator with Damping , 2001 .

[28]  Hong-Kun Xu.  Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces , 2010 .

[29]  A. Gibali,et al.  A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications , 2019, Journal of Industrial & Management Optimization.

[30]  Y. Censor,et al.  The multiple-sets split feasibility problem and its applications for inverse problems , 2005 .

[31]  C. Byrne,et al.  Iterative oblique projection onto convex sets and the split feasibility problem , 2002 .

[32]  Y. J. Cho,et al.  Inertial projection and contraction algorithms for variational inequalities , 2018, J. Glob. Optim..

[33]  Hong-Kun Xu,et al.  Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process , 1993 .

[34]  Heinz H. Bauschke,et al.  On Projection Algorithms for Solving Convex Feasibility Problems , 1996, SIAM Rev..

[35]  P. Cholamjiak,et al.  The modified inertial relaxed CQ algorithm for solving the split feasibility problems , 2017 .

[36]  Suthep Suantai,et al.  A New Hybrid CQ Algorithm for the Split Feasibility Problem in Hilbert Spaces and Its Applications to Compressed Sensing , 2019, Mathematics.

[37]  Qingzhi Yang.  On variable-step relaxed projection algorithm for variational inequalities , 2005 .

[38]  Y. J. Cho,et al.  Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings , 2018, Optim. Lett..