Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem
From MaRDI portal
Publication:2350395
DOI10.1007/S11766-014-3070-0zbMath1324.47114OpenAlexW2026392561MaRDI QIDQ2350395
Publication date: 29 June 2015
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-014-3070-0
Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Equations involving nonlinear operators (general) (47J05)
Related Items (2)
Hybrid CQ projection algorithm with line-search process for the split feasibility problem ⋮ New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- A multiprojection algorithm using Bregman projections in a product space
- The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
- 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 self-adaptive projection method for solving the multiple-sets split feasibility problem
- Decomposition through formalization in a product space
- 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
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem