Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis
From MaRDI portal
Publication:288140
DOI10.1186/s13663-015-0462-7zbMath1346.49052OpenAlexW2179842479WikidataQ59436380 ScholiaQ59436380MaRDI QIDQ288140
Afrah A. N. Abdou, Zhangsong Yao, Yonghong Yao, Yeol Je Cho
Publication date: 24 May 2016
Published in: Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13663-015-0462-7
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Numerical methods based on nonlinear programming (49M37)
Related Items
Solving the multiple-set split equality common fixed-point problem of firmly quasi-nonexpansive operators ⋮ New inertial method for generalized split variational inclusion problems ⋮ An improved inertial extragradient subgradient method for solving split variational inequality problems ⋮ Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method ⋮ Modified hybrid iterative methods for generalized mixed equilibrium, variational inequality and fixed point problems ⋮ Accelerated hybrid viscosity and steepest-descent method for proximal split feasibility problems ⋮ A self-adaptive extragradient-CQ method for a class of bilevel split equilibrium problem with application to Nash Cournot oligopolistic electricity market models ⋮ Convergence Theorem for Variational Inequality in Hilbert Spaces with Applications ⋮ Unnamed Item ⋮ ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem ⋮ Unnamed Item ⋮ 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 ⋮ A new extragradient algorithm with adaptive step-size for solving split equilibrium problems ⋮ Inertial accelerated algorithms for the split common fixed-point problem of directed operators ⋮ A self-adaptive iterative algorithm for the split common fixed point problems
Cites Work
- Weak- and strong-convergence theorems of solutions to split feasibility problem for nonspreading type mapping in Hilbert spaces
- Multiple-set split feasibility problems for total asymptotically strict pseudocontractions mappings
- Regularized methods for the split feasibility problem
- Solving proximal split feasibility problems without prior knowledge of operator norms
- An extragradient method for solving split feasibility and fixed point 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
- A multiprojection algorithm using Bregman projections in a product space
- Strong convergence of a self-adaptive method for the split feasibility problem
- Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem
- Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
- 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
- Iterative Algorithms for Nonlinear Operators
- Solving the split feasibility problem without prior knowledge of matrix norms
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- Signal Recovery by Proximal Forward-Backward Splitting
- Several solution methods for the split feasibility problem
This page was built for publication: Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis
