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
โฆ LIBER โฆ
Approximate proximal algorithms for generalized variational inequalities with pseudomonotone multifunctions
โ Scribed by Ceng, L. C. (author);Yao, J. C. (author)
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 216 KB
- Volume
- 213
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Approximate proximal algorithms for gene
โ
Ceng, L. C. (author);Yao, J. C. (author)
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 216 KB
Approximate proximal algorithms for gene
โ
L.C. Ceng; T.C. Lai; J.C. Yao
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 209 KB
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 pseudomonotoni
An algorithm for generalized variational
โ
Fenglian Li; Yiran He
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 455 KB
An existence theorem for generalized var
โ
B.T. Kien; G.M. Lee
๐
Article
๐
2011
๐
Elsevier Science
๐
English
โ 217 KB
Iterative Algorithms for Finding Approxi
โ
L.C. Zeng
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 254 KB