MARATTO

article · Axioms

A Totally Relaxed, Self-Adaptive Tseng Extragradient Method for Monotone Variational Inequalities

Abstract

In this work, we study a class of variational inequality problems defined over the intersection of sub-level sets of a countable family of convex functions. We propose a new iterative method for approximating the solution within the framework of Hilbert spaces. The method incorporates several strategies, including inertial effects, a self-adaptive step size, and a relaxation technique, to enhance convergence properties. Notably, it requires computing only a single projection onto a half space. Using some mild conditions, we prove that the sequence generated by our proposed method is strongly convergent to a minimum-norm solution to the problem. Finally, we present some numerical results that validate the applicability of our proposed method.

Research topics

  • Optimization and Variational Analysis
  • Advanced Optimization Algorithms Research
  • Contact Mechanics and Variational Inequalities

Read the original research

This page summarises published work. The authoritative version sits with the publisher.

DOI: 10.3390/axioms14050354

Is something wrong with this record? Report it or request removal.

Discussion

Discuss this research

Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.

No discussion yet. Open the first thread.