New Self-Adaptive Algorithms and Inertial Self-Adaptive Algorithms for the Split Variational Inclusion Problems in Hilbert Space

In the field of convex optimization, numerous problems can be modeled as the split variational inclusion problem. In this paper, we want to give self-adaptive algorithms and inertial self-adaptive algorithms to study the split variational inclusion problems. Next, we propose related convergence theo...

Full description

Saved in:
Bibliographic Details
Published in:Numerical functional analysis and optimization Vol. 43; no. 9; pp. 1050 - 1068
Main Authors: Chuang, Chih-Sheng, Hong, Chung-Chien
Format: Journal Article
Language:English
Published: Abingdon Taylor & Francis 04.07.2022
Taylor & Francis Ltd
Subjects:
Adaptive algorithms
Computational geometry
Convexity
Hilbert space
inertial algorithm
inertial self-adaptive algorithm
Optimization
Self-adaptive algorithm
split feasibility problem
split variational inclusion problem
ISSN:0163-0563, 1532-2467
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the field of convex optimization, numerous problems can be modeled as the split variational inclusion problem. In this paper, we want to give self-adaptive algorithms and inertial self-adaptive algorithms to study the split variational inclusion problems. Next, we propose related convergence theorems under suitable conditions.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0163-0563
1532-2467
DOI:10.1080/01630563.2022.2084753