Gradient methods with selection technique for the multiple-sets split feasibility problem

DOI10.1080/02331934.2019.1602772zbMath1441.47082OpenAlexW2928783095MaRDI QIDQ5213370

Yonghong Yao, Zhichuan Zhu, Mihai Postolache

Publication date: 3 February 2020

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2019.1602772

zbMATH Keywords

iterative algorithmstrong convergenceprojectiongradient methodreal Hilbert spacesmultiple-sets split feasibility problem

Mathematics Subject Classification ID

Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Programming in abstract spaces (90C48) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)

Related Items

Ball-relaxed projection algorithms for multiple-sets split feasibility problem, A self-adaptive extragradient algorithm for solving quasimonotone variational inequalities, Strong convergence theorem for common zero points of inverse strongly monotone mappings and common fixed points of generalized demimetric mappings, An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem, An inertial method for solving generalized split feasibility problems over the solution set of monotone variational inclusions, Two iterative algorithms for solving the split common fixed point problems, Extragradient methods with CQ technique for fixed point problems and equilibrium problems, Modified Tseng's extragradient methods with self-adaptive step size for solving bilevel split variational inequality problems, New Self-Adaptive Algorithms and Inertial Self-Adaptive Algorithms for the Split Variational Inclusion Problems in Hilbert Space, New inertial method for generalized split variational inclusion problems, A hybrid projection method for solving the multiple-sets split feasibility problem, Split common fixed point problem for demimetric mappings and Bregman relatively nonexpansive mappings, Modified extragradient algorithms for solving monotone variational inequalities and fixed point problems, Modified viscosity implicit rules for proximal split feasibility and fixed point problems, Some inequality techniques in handling fixed point problems on unbounded sets via homotopy methods, Globally convergent method for designing twice spline contractual function, An inertial extrapolation method for multiple-set split feasibility problem, Homotopy method for solving mathematical programs with bounded box-constrained variational inequalities, Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets, Two inertial subgradient extragradient algorithms for variational inequalities with fixed-point constraints, Iteration process for fixed point problems and zeros of maximal monotone operators, Composite steepest-descent method for the triple hierarchical variational inequalities, A new algorithm for finding a common solution of a split variational inequality problem, the fixed point problems and the variational inclusion problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Split common fixed point problem for two quasi-pseudo-contractive operators and its algorithm construction
• Cyclic algorithms for split feasibility problems in Hilbert spaces
• ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
• Strong convergence of a self-adaptive method for the split feasibility problem in Banach spaces
• Convergence theorems for split feasibility problems on a finite sum of monotone operators and a family of nonexpansive mappings
• A multiprojection algorithm using Bregman projections in a product space
• Iterative algorithms for the multiple-sets split feasibility problem in Hilbert spaces
• Strong convergence of a self-adaptive method for the split feasibility problem
• Iterative process for solving a multiple-set split feasibility problem
• On split common fixed point problems
• General method for solving the split common fixed point problem
• Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem
• A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
• Strong Convergence Theorem for Multiple Sets Split Feasibility Problems in Banach Spaces
• Iterative Algorithms for Nonlinear Operators
• Multi-step hybrid steepest-descent methods for split feasibility problems with hierarchical variational inequality problem constraints
• The multiple-sets split feasibility problem and its applications for inverse problems
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• The split common fixed-point problem for demicontractive mappings
• Iterative oblique projection onto convex sets and the split feasibility problem
• Self-adaptive algorithms for the split problem of the demicontractive operators
• Strong convergence of an iterative algorithm involving nonlinear mappings of nonexpansive and accretive type
• Strong convergence of projected reflected gradient methods for variational inequalities
• Two simple relaxed perturbed extragradient methods for solving variational inequalities in Euclidean spaces
• Iterative algorithms for the split variational inequality and fixed point problems under nonlinear transformations
• A general algorithm for multiple-sets split feasibility problem involving resolvents and Bregman mappings
• On Projection Algorithms for Solving Convex Feasibility Problems
• Fixed point algorithms for split feasibility problems
• On global convergence rate of two acceleration projection algorithms for solving the multiple-sets split feasibility problem
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces