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

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

zbMATH Keywords

split feasibility problemCQ methodinverse strongly monotoneprojection and contraction methodmodified projection and contraction method

Mathematics Subject Classification ID

Monotone operators and generalizations (47H05) Fixed-point theorems (47H10) Fixed-point and coincidence theorems (topological aspects) (54H25) Monotone and positive operators on ordered Banach spaces or other ordered topological vector spaces (47H07)

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On solving split equilibrium problems and fixed point problems of nonspreading multi-valued mappings in Hilbert spaces
• Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis
• Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size
• On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
• A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem
• An algorithm for a class of split feasibility problems: application to a model in electricity production
• The subgradient extragradient method for solving variational inequalities in Hilbert space
• The relaxed inexact projection methods for the split feasibility problem
• A multiprojection algorithm using Bregman projections in a product space
• A class of iterative methods for solving nonlinear projection equations
• Note on the modified relaxation CQ algorithm for the split feasibility problem
• On variable-step relaxed projection algorithm for variational inequalities
• On descent-projection method for solving the split feasibility problems
• Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
• A class of projection and contraction methods for monotone variational inequalities
• Polyak's gradient method for split feasibility problem constrained by level sets
• Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
• A new halfspace-relaxation projection method for the split feasibility problem
• The extragradient algorithm with inertial effects for solving the variational inequality
• A simple projection method for solving the multiple-sets split feasibility problem
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
• Self-adaptive projection methods for the multiple-sets split feasibility problem
• Solving the split feasibility problem without prior knowledge of matrix norms
• The multiple-sets split feasibility problem and its applications for inverse problems
• A self-adaptive projection method for solving the multiple-sets split feasibility problem
• A relaxed projection method for variational inequalities
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• A regularization algorithm for a splitting feasibility problem in Hilbert spaces
• On Projection Algorithms for Solving Convex Feasibility Problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• Strong convergence for generalized multiple-set split feasibility problem
• A note on the CQ algorithm for the split feasibility problem
• Convex analysis and monotone operator theory in Hilbert spaces