A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
From MaRDI portal
Publication:2808325
DOI10.1080/02331934.2014.895898zbMath1337.47089OpenAlexW1997065577MaRDI QIDQ2808325
Ziyi Zhao, Songnian He, Biao Luo
Publication date: 23 May 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2014.895898
strong convergenceHilbert spacebounded linear operatormultiple-sets split feasibility problemrelaxed CQ algorithm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25)
Related Items
Ball-relaxed projection algorithms for multiple-sets split feasibility problem, A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem, The combination projection method for solving convex feasibility problems, An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem, Split common fixed point problem of nonexpansive semigroup, Linear approximation method for solving split inverse problems and its applications, Solving the multiple-set split feasibility problem and the equilibrium problem by a new relaxed CQ algorithm, Modified Tseng's extragradient methods with self-adaptive step size for solving bilevel split variational inequality problems, Unnamed Item, The ball-relaxed CQ algorithms for the split feasibility problem, General algorithms for split common fixed point problem of demicontractive mappings, New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces, Gradient methods with selection technique for the multiple-sets split feasibility problem, Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces, Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems, Convergence analysis of an iterative method for solving multiple-set split feasibility problems in certain Banach spaces, Adaptive subgradient method for the split quasi-convex feasibility problems, The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem, An inertial relaxed CQ algorithm with an application to the LASSO and elastic net, Self-adaptive algorithms for an equilibrium split problem in Hilbert spaces
Cites Work
- Perturbation techniques for nonexpansive mappings with applications
- A multiprojection algorithm using Bregman projections in a product space
- On variable-step relaxed projection algorithm for variational inequalities
- Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
- Self-adaptive projection method for co-coercive variational inequalities
- 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
- Iterative Algorithms for Nonlinear Operators
- Solving the split feasibility problem without prior knowledge of matrix norms
- 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
- A sufficient and necessary condition for Halpern-type strong convergence to fixed points of nonexpansive mappings
- A Hybrid Extragradient-Viscosity Method for Monotone Operators and Fixed Point Problems
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- Generalized KM theorems and their applications
- Fixed points of nonexpanding maps
