Publication Type

Journal Article

Version

publishedVersion

Publication Date

3-2023

Abstract

This paper proposes a new inertial triple-projection algorithm for solving the split feasibility problem (SFP).The process of projections is divided into three parts. Each part adopts a different variable stepsize to obtain its projection point, which is different from the existing extragradient methods. Flexible rules are employed for selecting the stepsizes and the inertial technique is used for improving the convergence. Convergence results are proven. Numerical experiments show that the proposed method converges more quickly than the general CQ algorithm.

Keywords

Split feasible problem, triple-projection algorithm, Armijo-type line search, inertial technique

Discipline

Operations and Supply Chain Management

Research Areas

Operations Management

Publication

Journal of Industrial and Management Optimization

Volume

19

Issue

3

First Page

1813

Last Page

1826

ISSN

1547-5816

Identifier

10.3934/jimo.2022019

Publisher

American Institute of Mathematical Sciences (AIMS)

Additional URL

https://doi.org/10.3934/jimo.2022019

Share

COinS