Journal of Inequalities and Applications

Table 1 Computation result for Example 4.1

From: Weak and strong convergence Bregman extragradient schemes for solving pseudo-monotone and non-Lipschitz variational inequalities

		Algorithm 1.1	Algorithm 1.2	Algorithm 3.1	Algorithm 3.6
m = 50	No of Iter.	33	60	31	16
m = 50	CPU time (sec)	0.0074	0.0184	0.0099	0.0040
m = 100	No of Iter.	60	48	29	19
m = 100	CPU time (sec)	0.0169	0.0143	0.0094	0.0063
m = 200	No of Iter.	72	54	50	19
m = 200	CPU time (sec)	0.0258	0.0183	0.0170	0.0034
m = 500	No of Iter.	148	120	68	59
m = 500	CPU time (sec)	0.0609	0.0469	0.0193	0.0172

Back to article page