The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem

DOI10.1186/s13660-021-02725-5zbMath1504.65123OpenAlexW4200206274MaRDI QIDQ2072995

Meixia Li, Wen-Ting Chen

Publication date: 26 January 2022

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-021-02725-5

zbMATH Keywords

convergencemultiple-sets split feasibility problemArmijo-type line searchinertia relaxed algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52)

Cites Work

• Unnamed Item
• Unnamed Item
• An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
• Inertial Douglas-Rachford splitting for monotone inclusion problems
• A moving asymptotes algorithm using new local convex approximation methods with explicit solutions
• Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
• Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
• An inertial forward-backward algorithm for monotone inclusions
• A multiprojection algorithm using Bregman projections in a product space
• Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
• A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
• New inertial relaxed method for solving split feasibilities
• Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
• Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
• Inertial accelerated algorithms for solving a split feasibility problem
• An inertial alternating direction method of multipliers
• A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
• The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
• Self-adaptive projection methods for the multiple-sets 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
• A relaxed projection method for variational inequalities
• The relaxed CQ algorithm solving the split feasibility problem
• A globally convergent modified version of the method of moving asymptotes
• Hybrid inertial proximal algorithm for the split variational inclusion problem in Hilbert spaces with applications
• A New Algorithm for Solving The Multiple-Sets Split Feasibility Problem in Banach Spaces
• Minimization of unsmooth functionals

This page was built for publication: The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem