``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem

From MaRDI portal
Publication:721148

DOI10.1007/s10898-018-0628-zOpenAlexW2793623666MaRDI QIDQ721148

Yeol Je Cho, Themistocles M. Rassias, Qiao-Li Dong, Yu-Chao Tang

Publication date: 18 July 2018

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-018-0628-z



Related Items

Ball-relaxed projection algorithms for multiple-sets split feasibility problem, The combination projection method for solving convex feasibility problems, An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces, A double projection algorithm with inertial effects for solving split feasibility problems and applications to image restoration, A relaxed projection method using a new linesearch for the split feasibility problem, A new iterative method with alternated inertia for the split feasibility problem, An explicit extragradient algorithm for solving variational inequalities, Fixed points of nonlinear contractions with applications, Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration, Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators, An alternated inertial general splitting method with linearization for the split feasibility problem, Two inertial-type algorithms for solving the split feasibility problem, Alternated inertial algorithms for split feasibility problems, A strongly convergent viscosity-type inertial algorithm with self adaptive stepsize for solving split variational inclusion problems in Hilbert spaces, A dynamic simultaneous algorithm for solving split equality fixed point problems, A new strong convergence for solving split variational inclusion problems, Global and linear convergence of alternated inertial methods for split feasibility problems, General splitting methods with linearization for the split feasibility problem, Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces, Gradient methods with selection technique for the multiple-sets split feasibility problem, New inertial relaxed method for solving split feasibilities, Explicit extragradient-like method with adaptive stepsizes for pseudomonotone variational inequalities, Unnamed Item, The iterative method for solving the proximal split feasibility problem with an application to LASSO problem, Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization, A method with inertial extrapolation step for split monotone inclusion problems, A new self-adaptive method for the split equality common fixed-point problem of quasi-nonexpansive mappings, Two projection algorithms for a class of split feasibility problems with jointly constrained Nash equilibrium models, Proximal type algorithms involving linesearch and inertial technique for split variational inclusion problem in hilbert spaces with applications, A self-adaptive iterative algorithm for the split common fixed point problems



Cites Work