Parallel inertial forward–backward splitting methods for solving variational inequality problems with variational inclusion constraints

The inertial forward–backward splitting algorithm can be considered as a modified form of the forward–backward algorithm for variational inequality problems with monotone and Lipschitz continuous cost mappings. By using parallel and inertial techniques and the forward–backward splitting algorithm, in this paper, we propose a new parallel inertial forward–backward splitting algorithm for solving variational inequality problems, where the constraints are the intersection of common solution sets of a finite family of variational inclusion problems. Then, strong convergence of proposed iteration sequences is showed under standard assumptions imposed on cost mappings in a real Hilbert space. Finally, some numerical experiments demonstrate the reliability and benefits of the proposed algorithm.

Authors

Institutions

Publication Details

Journal
Mathematical Methods in the Applied Sciences
Published
2024-09-08
DOI
https://doi.org/10.1002/mma.10356
Citations
2
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
0.72

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Parallel inertial forward–backward splitting methods for solving variational inequality problems with variational inclusion constraints

Trần Văn Thắng, Ha Manh Tien
2 citations
Mathematical Methods in the Applied Sciences
Optimization and Variational Analysis
0.72
article

Parallel inertial forward–backward splitting methods for solving variational inequality problems with variational inclusion constraints

Trần Văn Thắng, Ha Manh Tien
article en
2 citations

Abstract

The inertial forward–backward splitting algorithm can be considered as a modified form of the forward–backward algorithm for variational inequality problems with monotone and Lipschitz continuous cost mappings. By using parallel and inertial techniques and the forward–backward splitting algorithm, in this paper, we propose a new parallel inertial forward–backward splitting algorithm for solving variational inequality problems, where the constraints are the intersection of common solution sets of a finite family of variational inclusion problems. Then, strong convergence of proposed iteration sequences is showed under standard assumptions imposed on cost mappings in a real Hilbert space. Finally, some numerical experiments demonstrate the reliability and benefits of the proposed algorithm.

Mathematical Methods in the Applied SciencesVol. 48(1)
Electric Power University (VN)
National Foundation for Science and Technology Development
Reduced inequalities
Openalex Percentile: Top 26%
Optimization and Variational Analysis
0.72
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.