The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem
From MaRDI portal
Publication:2072995
Recommendations
- A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- Relaxed successive projection algorithm with strong convergence for the multiple-sets split equality problem
- Successive relaxed projection algorithm for multiple-sets split equality problem
- An inertial extrapolation method for multiple-set split feasibility problem
Cites work
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- A globally convergent modified version of the method of moving asymptotes
- A moving asymptotes algorithm using new local convex approximation methods with explicit solutions
- A multiprojection algorithm using Bregman projections in a product space
- A new algorithm for solving the multiple-sets split feasibility problem in Banach spaces
- A relaxed projection method for variational inequalities
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- An inertial alternating direction method of multipliers
- An inertial forward-backward algorithm for monotone inclusions
- An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
- Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
- Convergence analysis of an inertial iterate for the proximal split feasibility problem
- Hybrid inertial proximal algorithm for the split variational inclusion problem in Hilbert spaces with applications
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- Inertial accelerated algorithms for solving a split feasibility problem
- Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
- Minimization of unsmooth functionals
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
- New inertial relaxed method for solving split feasibilities
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- 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
Cited in
(3)
This page was built for publication: The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2072995)
