Strong convergence of a self-adaptive method for the split feasibility problem

DOI10.1186/1687-1812-2013-201zbMath1403.65027OpenAlexW2169188538WikidataQ59301109 ScholiaQ59301109MaRDI QIDQ2253220

Yonghong Yao, Mihai Postolache, Yeong-Cheng Liou

Publication date: 25 July 2014

Published in: Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/1687-1812-2013-201

zbMATH Keywords

minimization problemprojectionsplit feasibility problemself-adaptive methodminimum-norm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Variational inequalities (49J40) Iterative procedures involving nonlinear operators (47J25)

Related Items

Convergence theorems for split feasibility problems on a finite sum of monotone operators and a family of nonexpansive mappings, Simultaneous iterative algorithms for the split common fixed-point problem of generalized asymptotically quasi-nonexpansive mappings without prior knowledge of operator norms, Split common fixed point problem for two quasi-pseudo-contractive operators and its algorithm construction, Extra-gradient methods for solving split feasibility and fixed point problems, Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis, Weak convergence of a Mann-like algorithm for nonexpansive and accretive operators, An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem, Linear approximation method for solving split inverse problems and its applications, Self-adaptive algorithms for the split problem of the demicontractive operators, Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces, A strongly convergent algorithm for the split common fixed point problem, Two iterative algorithms for solving the split common fixed point problems, The regularized CQ algorithm without \textit{a priori} knowledge of operator norm for solving the split feasibility problem, Preconditioning methods for solving a general split feasibility problem, Adaptively relaxed algorithms for solving the split feasibility problem with a new step size, Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem, On split common solution problems: new nonlinear feasible algorithms, strong convergence results and their applications, Alternating Mann iterative algorithms for the split common fixed-point problem of quasi-nonexpansive mappings, Self-adaptive algorithms for solving split feasibility problem with multiple output sets, The common solutions of the split feasibility problems and fixed point problems, An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net, Iterative algorithms for the split problem and its convergence analysis, Fixed point algorithms for the split problem of demicontractive operators, Strong convergence theorems for a nonexpansive mapping and its applications for solving the split feasibility problem, The split variational inequality problem and its algorithm iteration, The split common fixed-point problem for demicontractive mappings and quasi-nonexpansive mappings, Simultaneous iterative algorithm for the split equality fixed-point problem of demicontractive mappings, A projected fixed point algorithm with Meir-Keeler contraction for pseudocontractive mappings, Iterative algorithms for the split variational inequality and fixed point problems under nonlinear transformations, Viscosity approximation methods for the multiple-set split equality common fixed-point problems of demicontractive mappings, On the split feasibility problem and fixed point problem of quasi-\(\phi\)-nonexpansive mapping in Banach spaces, Strong convergence theorems for an implicit iterative algorithm for the split common fixed point problem, Weak and strong convergence theorems for the multiple-set split equality common fixed-point problems of demicontractive mappings, Solving the split feasibility problem and the fixed point problem of left Bregman firmly nonexpansive mappings via the dynamical step sizes in Banach spaces, Strong convergence theorems for the general split common fixed point problem in Hilbert spaces, Generalized extragradient iterative methods for solving split feasibility and fixed point problems in Hilbert spaces, Self-adaptive algorithms with inertial effects for solving the split problem of the demicontractive operators, Gradient methods with selection technique for the multiple-sets split feasibility problem, Mixed simultaneous iterative algorithms for the extended multiple-set split equality common fixed-point problem with Lipschitz quasi-pseudocontractive operators, Some remarks on the paper ``Strong convergence of a self-adaptive method for the split feasibility problem, A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem, A strong convergence theorem for an iterative method for solving the split variational inequalities in Hilbert spaces, Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization, Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets, An iterative viscosity approximation method for the split common fixed-point problem, Weak and strong convergence theorems for the split common fixed point problem with demicontractive operators, Three-step iterations for total asymptotically nonexpansive mappings in CAT(0) spaces, Viscosity Approximation Methods for Split Common Fixed-Point Problem of Directed Operators, New algorithms designed for the split common fixed point problem of quasi-pseudocontractions, New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mann type iterative methods for finding a common solution of split feasibility and fixed point problems
• Implicit relaxed and hybrid methods with regularization for minimization problems and asymptotically strict pseudocontractive mappings in the intermediate sense
• Regularized methods for the split feasibility problem
• Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
• Extragradient-projection method for solving constrained convex minimization problems
• Cyclic algorithms for split feasibility problems in Hilbert spaces
• Some iterative methods for finding fixed points and for solving constrained convex minimization problems
• The relaxed inexact projection methods for the split feasibility problem
• Averaged mappings and the gradient-projection algorithm
• An extragradient method for solving split feasibility and fixed point problems
• Solving linear variational inequality problems by a self-adaptive projection method
• Inexact operator splitting methods with selfadaptive strategy for variational inequality problems
• Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
• Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
• On the convergence of Han's method for convex programming with quadratic objective
• A successive projection method
• A multiprojection algorithm using Bregman projections in a product space
• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• A self-adaptive projection and contraction method for monotone symmetric linear variational inequalities.
• On variable-step relaxed projection algorithm for variational inequalities
• A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems
• Self-adaptive projection method for co-coercive variational inequalities
• Multi-step implicit iterative methods with regularization for minimization problems and fixed point problems
• 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
• 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
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• A self-adaptive projection method for solving the multiple-sets split feasibility problem
• A relaxed projection method for variational inequalities
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• 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
• Convex programming in Hilbert space
• The method of projections for finding the common point of convex sets
• A note on the CQ algorithm for the split feasibility problem
• Several solution methods for the split feasibility problem
• Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities