MARATTO

article · Results in Applied Mathematics

Two step inertial Tseng method for solving monotone variational inclusion problem

Abstract

In this paper, we examine the monotone variational inclusion problem with a maximal monotone operator and a Lipschitz continuous monotone operator. We propose two different iterative algorithms for solving the monotone variational inclusion problem, utilizing a new self-adaptive step size and a two-step inertial technique. Under the assumption that the solution set of the monotone variational inclusion problem is nonempty, we prove weak and strong convergence theorems concerning the sequences generated by our proposed algorithms. The convergence is guaranteed under some mild assumptions. Some numerical experiments are presented to demonstrate the performance of our iterative algorithms in comparison with recent results in the literature.

Research topics

  • Optimization and Variational Analysis
  • Topology Optimization in Engineering
  • Advanced Optimization Algorithms Research

Sustainable Development Goals

Read the original research

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

DOI: 10.1016/j.rinam.2025.100545

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.