An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces
From MaRDI portal
Publication:2142548
DOI10.1007/s12190-021-01585-yOpenAlexW3189542584MaRDI QIDQ2142548
Publication date: 27 May 2022
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-021-01585-y
Numerical mathematical programming methods (65K05) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Numerical optimization and variational techniques (65K10) Iterative procedures involving nonlinear operators (47J25)
Related Items (5)
An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem ⋮ An inertial self-adaptive iterative algorithm for finding the common solutions to split feasibility and fixed point problems in specific Banach spaces ⋮ A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem ⋮ A novel projection method for split feasibility problems with applications to compressive sensing ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mann type iterative methods for finding a common solution of split feasibility and fixed point problems
- On the convergence of CQ algorithm with variable steps for the split equality problem
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- A multiprojection algorithm using Bregman projections in a product space
- A new self-adaptive CQ algorithm with an application to the LASSO problem
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- On variable-step relaxed projection algorithm for variational inequalities
- Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
- New inertial relaxed method for solving split feasibilities
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- A new CQ algorithm for solving split feasibility problems in Hilbert spaces
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- Inertial accelerated algorithms for solving a split feasibility problem
- A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models
- 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
- Solving the split feasibility problem without prior knowledge of matrix norms
- The multiple-sets split feasibility problem and its applications for inverse problems
- A relaxed projection method for variational inequalities
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- A halpern-type iteration for solving the split feasibility problem and the fixed point problem of Bregman relatively nonexpansive semigroup in Banach spaces
- Iterative methods for the split feasibility problem and the fixed point problem in Banach spaces
- Fixed Point Theory for Lipschitzian-type Mappings with Applications
- Fixed points of nonexpanding maps
- A note on the CQ algorithm for the split feasibility problem
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Convex analysis and monotone operator theory in Hilbert spaces
- Weak and strong convergence theorems for fixed points of asymptotically nonexpansive mappings
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
This page was built for publication: An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces
