A new relaxed method for the split feasibility problem in Hilbert spaces
From MaRDI portal
Publication:6492466
DOI10.1080/02331934.2022.2158036MaRDI QIDQ6492466
Publication date: 25 April 2024
Published in: Optimization (Search for Journal in Brave)
Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Inverse problems in optimal control (49N45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- The relaxed inexact projection methods for the split feasibility problem
- Averaged mappings and the gradient-projection algorithm
- A multiprojection algorithm using Bregman projections in a product space
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- On variable-step relaxed projection algorithm for variational inequalities
- A relaxed alternating CQ-algorithm for convex feasibility problems
- Polyak's gradient method for split feasibility problem constrained by level sets
- Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
- A new halfspace-relaxation projection method for the split feasibility problem
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Solving the split feasibility problem without prior knowledge of matrix norms
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- A relaxed projection method for variational inequalities
- Two-Point Step Size Gradient Methods
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- The ball-relaxed CQ algorithms for the split feasibility problem
- The relaxed CQ algorithm solving the split feasibility problem
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- A note on the CQ algorithm for the split feasibility problem
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: A new relaxed method for the split feasibility problem in Hilbert spaces