.png){kind=icon}
.png){kind=icon}
Return
An improved double projection algorithm for solving variational inequalities
.png){kind=icon}
PRE
AI
DOI：10.1007/s11587-026-01083-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we present a new projection method aimed to solve the variational inequalities problem. Unlike existing algorithms within the same family, our approach incorporates a distinct line search step and a novel strategy for determining the step size used in the computation of the sequence generated by the associated algorithm. These enhancements enable the development of a robust algorithm whose global convergence is proven under weak assumptions. Furthermore, the encouraging results derived from the comparative numerical study highlight the effectiveness of the proposed algorithm.
Keywords:
Variational inequalities problem
Projection methods
Line search step
Journal
R
IF:
1.1
Papers:
104
Citations:
0