The Cimmino Algorithm for Inverse Strongly-Monotone Mappings

Read full text
Authors: Alexander J. Zaslavski
Cited by: 1
References: 13

Abstract

In 2003 W. Takahashi and M. Toyodaestablished the weak convergence of an iteration process to solve a variational inequality problem induced by an inverse strongly-monotone mapping. Recently we proved that for the same iterative process, most of its exact iterates are approximate solutions of the variational inequality. It was also shown that the iteration process for solving a variational inequality problem for an inverse strongly-monotone mapping generates approximate solutions in the presence of computational errors. In this work we employ the Cimmino algorithm in order to generalize these results for common approximate solutions of a finite family of variational inequalities with inverse strongly-monotone mappings and of a finite family of fixed point problems in the presence of computational errors.

Fields of Study & Subjects

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

Publication details

Journal / source
Axioms
Publisher
MDPI AG
Volume
15
Issue
5
Pages
331–331
Publication date
1 May 2026
Language
EN