An inertial conjugate gradient projection method for the split feasibility problem
From MaRDI portal
Cites work
- A class of conjugate gradient methods for convex constrained monotone equations
- A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations
- A family of inertial derivative-free projection methods for constrained nonlinear pseudo-monotone equations with applications
- A fixed point method for solving a split feasibility problem in Hilbert spaces
- A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications
- A modified inertial three-term conjugate gradient projection method for constrained nonlinear equations with applications in compressed sensing
- A multiprojection algorithm using Bregman projections in a product space
- A note on the CQ algorithm for the split feasibility problem
- A spectral gradient projection algorithm for convex constrained nonsmooth equations based on an adaptive line search
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- An adaptive family of projection methods for constrained monotone nonlinear equations with applications
- Convex analysis and monotone operator theory in Hilbert spaces
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- General splitting methods with linearization for the split feasibility problem
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 204196 (Why is no real title available?)
- scientific article; zbMATH DE number 3441150 (Why is no real title available?)
- Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration
- 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
- Multivariate spectral DY-type projection method for convex constrained nonlinear monotone equations
- New hybrid conjugate gradient projection method for the convex constrained equations
- New inertial relaxed method for solving split feasibilities
- On variable-step relaxed projection algorithm for variational inequalities
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- Solving the split feasibility problem without prior knowledge of matrix norms
- Some methods of speeding up the convergence of iteration methods
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- The relaxed CQ algorithm solving the split feasibility problem
- The strong convergence of Douglas-Rachford methods for the split feasibility problem
- Three derivative-free projection methods for nonlinear equations with convex constraints
This page was built for publication: An inertial conjugate gradient projection method for the split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6996680)
