Modified inertial self-adaptive techniques for the split feasibility problem
From MaRDI portal
Cites work
- A multiprojection algorithm using Bregman projections in a product space
- A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem
- A note on the CQ algorithm for the split feasibility problem
- An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces
- Convex programming in Hilbert space
- Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- New inertial relaxed method for solving split feasibilities
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- Solving the split feasibility problem without prior knowledge of matrix norms
- Strong convergence of a self-adaptive method for the split feasibility problem
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- The method of projections for finding the common point of convex sets
- The multiple-sets split feasibility problem and its applications for inverse problems
- The relaxed CQ algorithm solving the split feasibility problem
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
This page was built for publication: Modified inertial self-adaptive techniques for the split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326879)