A Tseng algorithm based on the golden ratio technique for solving variational inequality problems in Hilbert spaces.

Abstract This study is concerned with an iterative approximation of solution to variational inequality problem. We propose a Tseng iterative method based on the golden ratio technique for solving the variational inequality problem associated with a quasimonotone operator in Hilbert spaces. The propose method is self adaptive which implies the need to know the Lipschitz condition of the cost operator does not arise. Under some suitable and standard assumptions on the control parameters and the cost operator we prove that the sequence of iterate generated by the method converge weakly to a point in the solution set of the problem. Also, when the operator is assumed to be strongly pseudomonotone, we establish a R-linear convergence of the method. Finally, we report some numerical experiment to illustrate the performance of the proposed method.

Authors

Publication Details

Journal
The Journal of Analysis
Published
2026-05-30
DOI
https://doi.org/10.1007/s41478-026-01101-0
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

A Tseng algorithm based on the golden ratio technique for solving variational inequality problems in Hilbert spaces.

O. K. Oyewole, S. A. Kajola, A. E. Ofem, O. K. Narain
The Journal of Analysis
Optimization and Variational Analysis
article

A Tseng algorithm based on the golden ratio technique for solving variational inequality problems in Hilbert spaces.

O. K. Oyewole, S. A. Kajola, A. E. Ofem, O. K. Narain
article en

Abstract

Abstract This study is concerned with an iterative approximation of solution to variational inequality problem. We propose a Tseng iterative method based on the golden ratio technique for solving the variational inequality problem associated with a quasimonotone operator in Hilbert spaces. The propose method is self adaptive which implies the need to know the Lipschitz condition of the cost operator does not arise. Under some suitable and standard assumptions on the control parameters and the cost operator we prove that the sequence of iterate generated by the method converge weakly to a point in the solution set of the problem. Also, when the operator is assumed to be strongly pseudomonotone, we establish a R-linear convergence of the method. Finally, we report some numerical experiment to illustrate the performance of the proposed method.

The Journal of Analysis
Inyuvesi Yakwazulu-Natali
Reduced inequalities
Openalex Percentile: Top 4%
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.