Tseng's Type Methods in Continuous and Discrete Time for Quasi-Variational Inequalities

2025/05/07 by Lkhamsuren Altangerel, Altangerel, Lkhamsuren
Computer Science · Mathematics · #49J40 #65K15 49J40 #Advanced Optimization Algorithms Research #Contact Mechanics and Variational Inequalities #FOS: Mathematics #Optimization and Control (math.OC) #Optimization and Variational Analysis

paper · pdf · doi:10.48550/arxiv.2505.04102

openalex publication_date 2025/05/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper presents an approach for obtaining approximate solutions to quasi-variational inequalities in a real Hilbert space by modifying Tseng's scheme, which was originally designed for variational inequalities. The study explores the existence of equilibrium points and investigates convergence results related to dynamical systems. Linear convergence for discretized systems is examined through examples, illustrations, and special cases.

Citations

• Linear Convergence Results for Inertial Type Projection Algorithm for Quasi-Variational Inequalities

Related

• A reconsideration of quasimonotone variational inequality problems
• Strong convergence of an inertial Tseng's extragradient algorithm for pseudomonotone variational inequalities with applications to optimal control problems
• Continuous and Discrete Systems for Quasi Variational Inequalities with Application to Game Theory
• Convergence Analysis of the Self-Adaptive Projection Method for Variational Inequalities with Non-Lipschitz Continuous Operators
• A Dantzig-Wolfe Decomposition Method for Quasi-Variational Inequalities