Two-Step Systems for G-H-Relaxed Pseudococoercive Nonlinear Variational Problems Based on Projection Methods

Ravi P. Agarwal, Donal O'Regan, Ram U. Verma

Research output: Contribution to a Journal (Peer & Non Peer)Articlepeer-review

1 Citation (Scopus)

Abstract

The approximation-solvability of a generalized system of nonlinear variational inequalities (SNVI) involving relaxed pseudococoercive mappings, based on the convergence of a system of projection methods, is presented. The class of relaxed pseudococoercive mappings is more general than classes of strongly monotone and relaxed cocoercive mappings. Let K1 and K2 be nonempty closed convex subsets of real Hilbert spaces H1 and H2, respectively. The two-step SNVI problem considered here is as follows: find an element (x*; y*) ∈ H1 × H2 such that (g(x*); g(y*)) ∈K1 × K2 and (formula omitted) are nonlinear mappings.

Original languageEnglish
Pages (from-to)1-10
Number of pages10
JournalGeorgian Mathematical Journal
Volume12
Issue number1
DOIs
Publication statusPublished - 2005

Keywords

  • Cocoercive mapping
  • convergence of projection methods
  • relaxed cocoercive mapping
  • relaxed pseudococoercive variational inequality
  • two-step system of variational inequalities

Fingerprint

Dive into the research topics of 'Two-Step Systems for G-H-Relaxed Pseudococoercive Nonlinear Variational Problems Based on Projection Methods'. Together they form a unique fingerprint.

Cite this