An inertial extrapolation method for multiple-set split feasibility problem
From MaRDI portal
Publication:2069587
DOI10.1186/s13660-020-02508-4zbMath1487.47113OpenAlexW3101877570MaRDI QIDQ2069587
Guash Haile Taddele, Poom Kumam, Anteneh Getachew Gebrie
Publication date: 20 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-020-02508-4
strong convergencesubdifferentialsublevel setmultiple-set split feasibility probleminertial extrapolationself-adaptive technique
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical solutions to equations with nonlinear operators (65J15)
Related Items (6)
An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem ⋮ A new self-adaptive accelerated method for generalized split system of common fixed-point problem of averaged mappings ⋮ Self-adaptive algorithms for solving split feasibility problem with multiple output sets ⋮ New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem ⋮ On split monotone variational inclusion problem with multiple output sets with fixed point constraints ⋮ An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative methods for fixed point problems in Hilbert spaces
- Several acceleration schemes for solving the multiple-sets split feasibility problem
- Split monotone variational inclusions
- Algorithms for the split variational inequality problem
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- Implicit and explicit algorithms for solving the split feasibility problem
- Two projection algorithms for solving the split common fixed point problem
- Approximation methods for common fixed points of nonexpansive mappings in Hilbert spaces
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- An inertial forward-backward algorithm for monotone inclusions
- Convergence theorems for inertial KM-type algorithms
- 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
- Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
- Iterative algorithms for the multiple-sets split feasibility problem in Hilbert spaces
- Viscosity approximation methods for fixed-points problems
- Parallel proximal method of solving split system of fixed point set constraint minimization problems
- 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
- Robust solutions of split feasibility problem with uncertain linear operator
- Several iterative algorithms for solving the split common fixed point problem of directed operators with applications
- The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
- Matrix p-Norms Are NP-Hard to Approximate If $p\neq1,2,\infty$
- 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 relaxed projection method for variational inequalities
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- 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
- Strong convergence result of split feasibility problems in Banach spaces
- Gradient methods with selection technique for the multiple-sets split feasibility problem
- Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators
- Parallel Iterative Methods for Solving the Split Common Fixed Point Problem in Hilbert Spaces
- A cyclic iterative method for solving Multiple Sets Split Feasibility Problems in Banach Spaces
- Split Feasibility and Fixed Point Problems
- Signal Recovery by Proximal Forward-Backward Splitting
- Generalized KM theorems and their applications
- A note on the CQ algorithm for the split feasibility problem
- Several solution methods for the split feasibility problem
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: An inertial extrapolation method for multiple-set split feasibility problem
