A modified projection and contraction method for solving a variational inequality problem in Hilbert spaces

In this paper, we proposed a modified projection and contraction method for solving a variational inequality problem in Hilbert spaces. In the existing projection and contraction methods for solving the variational inequality problem, the sequence $ \{\beta_n\} $ has a similar computation manner, which is computed in a self-adaptive manner, but the sequence $ \{\beta_n\} $ in our method is a sequence of numbers in (0, 1) given in advance, which is the main difference of our method with the existing projection and contraction methods. A line search is used to deal with the unknown Lipschitz constant of the mapping. The strong convergence of the proposed method is proved under certain conditions. Finally, some numerical examples are presented to illustrate the effectiveness of our method and compare the computation results with some related methods in the literature. The numerical results show that our method has an obvious competitive advantage compared with the related methods.

Authors

Institutions

Publication Details

Journal
AIMS Mathematics
Published
2025-01-01
DOI
https://doi.org/10.3934/math.2025279
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A modified projection and contraction method for solving a variational inequality problem in Hilbert spaces

Jianmin Song, Shenghua Wang, Limei Xue
AIMS Mathematics
Optimization and Variational Analysis
article

A modified projection and contraction method for solving a variational inequality problem in Hilbert spaces

Jianmin Song, Shenghua Wang, Limei Xue
article en

Abstract

In this paper, we proposed a modified projection and contraction method for solving a variational inequality problem in Hilbert spaces. In the existing projection and contraction methods for solving the variational inequality problem, the sequence $ \{\beta_n\} $ has a similar computation manner, which is computed in a self-adaptive manner, but the sequence $ \{\beta_n\} $ in our method is a sequence of numbers in (0, 1) given in advance, which is the main difference of our method with the existing projection and contraction methods. A line search is used to deal with the unknown Lipschitz constant of the mapping. The strong convergence of the proposed method is proved under certain conditions. Finally, some numerical examples are presented to illustrate the effectiveness of our method and compare the computation results with some related methods in the literature. The numerical results show that our method has an obvious competitive advantage compared with the related methods.

AIMS MathematicsVol. 10(3)
North China Electric Power University (CN), Hebei GEO University (CN)
Reduced inequalities
Openalex Percentile: Top 94%
Optimization and Variational Analysis
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.

A modified projection and contraction method for solving a variational inequality problem in Hilbert spaces — Jianmin Song, Shenghua Wang, et al. · AIMS Mathematics (2025) | TGRS Research Map | TGRS