๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximate proximal algorithms for generalized variational inequalities with paramonotonicity and pseudomonotonicity

โœ Scribed by L.C. Ceng; T.C. Lai; J.C. Yao

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
209 KB
Volume
55
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis

We propose an approximate proximal algorithm for solving generalized variational inequalities in Hilbert space. Extension to Bregman-function-based approximate proximal algorithm is also discussed. Weak convergence of these two algorithms are established under the paramonotonicity and pseudomonotonicity assumptions of the operators.

๐Ÿ“œ SIMILAR VOLUMES

Approximate proximal algorithms for gene
Approximate proximal algorithms for generalized variational inequalities with pseudomonotone multifunctions
โœ Ceng, L. C. (author);Yao, J. C. (author) ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 216 KB

The purpose of this paper is to investigate the convergence of general approximate proximal algorithm (resp. general Bregmanfunction-based approximate proximal algorithm) for solving the generalized variational inequality problem (for short, GVI(T , ) where T is a multifunction). The general approxi