An algorithm for finding a common point of the solution set of a variational inequality and the fixed point set of a Bregman relatively nonexpansive mapping (Q298439)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for finding a common point of the solution set of a variational inequality and the fixed point set of a Bregman relatively nonexpansive mapping |
scientific article; zbMATH DE number 6595624
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for finding a common point of the solution set of a variational inequality and the fixed point set of a Bregman relatively nonexpansive mapping |
scientific article; zbMATH DE number 6595624 |
Statements
An algorithm for finding a common point of the solution set of a variational inequality and the fixed point set of a Bregman relatively nonexpansive mapping (English)
0 references
20 June 2016
0 references
Bregman distance function
0 references
Bregman inverse strongly monotone mapping
0 references
Bregman relatively nonexpansive mapping
0 references
fixed points of mappings
0 references
strong convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9364293217658995
0 references
0.8545324802398682
0 references
0.8322619199752808
0 references
0.832026481628418
0 references
