LINEAR AND SUPERLINEAR CONVERGENCE OF AN INEXACT ALGORITHM WITH PROXIMAL DISTANCES FOR VARIATIONAL INEQUALITY PROBLEMS

E. A. Papa Quiroz, S. Cruzado Acuña

Research output: Contribution to journalArticlepeer-review

Abstract

This paper introduces an inexact proximal point algorithm using proximal distances with linear and superlinear rate of convergence for solving variational inequality problems when the mapping is pseudomonotone or quasimonotone. This algorithm is new even for the monotone case and from the theoretical point of view the error criteria used improves recent works in the literature.

Original languageEnglish
Pages (from-to)311-330
Number of pages20
JournalFixed Point Theory
Volume23
Issue number1
DOIs
StatePublished - 1 Feb 2022

Keywords

  • Proximal distances
  • Proximal point algorithms
  • Quasimonotone and pseudomonotone mappings
  • Variational inequalities

Fingerprint

Dive into the research topics of 'LINEAR AND SUPERLINEAR CONVERGENCE OF AN INEXACT ALGORITHM WITH PROXIMAL DISTANCES FOR VARIATIONAL INEQUALITY PROBLEMS'. Together they form a unique fingerprint.

Cite this