2025/09/06 by Watanjeet Singh, Singh, Watanjeet, Sumit Chandok +1
Computer Science · Engineering · #47H05 #47J20 #47J25 #65K15 #Contact Mechanics and Variational Inequalities #FOS: Mathematics #Functional Analysis (math.FA) #Optimization and Control (math.OC) #Optimization and Variational Analysis #Topology Optimization in Engineering
paper · pdf · doi:10.48550/arxiv.2509.05589
openalex publication_date 2025/09/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper presents an iterative scheme that converges to the solution of a pseudo-monotone variational inequality problem in the setting of ℝn. Traditional methods often require projections onto the feasible set \mathfrakC or onto a half-space containing \mathfrakC. However, computing projections onto a complicated feasible set can be difficult, and projections onto a half-space may fall outside \mathfrakC. Keeping this in mind, we aim to develop an iterative scheme that projects onto a ball that is contained in a feasible set and has an explicit expression. Our iterative scheme does not require prior knowledge of the Lipschitz constant of the cost operator. Finally, we provide some numerical experiments to show the effectiveness of our algorithm.