The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem
type: Item
instance of: scholarly article
title: The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem
zbMATH Open document ID: 1504.65123
author: Meixia Li
author: Wen-Ting Chen
published in: Journal of Inequalities and Applications
publication date: 2022-01-26T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 49J52
zbMATH DE Number: 7465169
zbMATH Keywords: multiple-sets split feasibility problem
zbMATH Keywords: inertia relaxed algorithm
zbMATH Keywords: Armijo-type line search
zbMATH Keywords: convergence
MaRDI profile type: Publication
full work available at URL: s13660-021-02725-5
OpenAlex ID: W4200206274
cites work: An inertial alternating direction method of multipliers
cites work: An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
cites work: Inertial Douglas-Rachford splitting for monotone inclusion problems
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: The multiple-sets split feasibility problem and its applications for inverse problems
cites work: Hybrid inertial proximal algorithm for the split variational inclusion problem in Hilbert spaces with applications
cites work: The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
cites work: Inertial accelerated algorithms for solving a split feasibility problem
cites work: Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
cites work: A relaxed projection method for variational inequalities
cites work: A globally convergent modified version of the method of moving asymptotes
cites work: A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
cites work: An inertial forward-backward algorithm for monotone inclusions
cites work: Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
cites work: A moving asymptotes algorithm using new local convex approximation methods with explicit solutions
cites work: Q3320132
cites work: Minimization of unsmooth functionals
cites work: New inertial relaxed method for solving split feasibilities
cites work: Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
cites work: A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
cites work: Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
cites work: A New Algorithm for Solving The Multiple-Sets Split Feasibility Problem in Banach Spaces
cites work: A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
cites work: The relaxed CQ algorithm solving the split feasibility problem
cites work: Q5160307
cites work: A self-adaptive projection method for solving the multiple-sets split feasibility problem
cites work: Self-adaptive projection methods for the multiple-sets split feasibility problem
cites work: Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
DOI: 10.1186/S13660-021-02725-5
description: scientific article; zbMATH DE number 7465169