Skip to main content

Table 1 Comparison of Algorithm 3.1 with GPM and VPGPM

From: Self-adaptive iterative method for solving boundedly Lipschitz continuous and strongly monotone variational inequalities

\(E_{n}\)

Iter.

CPU (in s)

VPGPM

GPM

Algorithm 3.1

VPGPM

GPM

Algorithm 3.1

110−1

7

11

5

0.000064

0.000488

0.001099

110−2

15

22

9

0.000126

0.000554

0.001709

110−3

31

33

13

0.000213

0.000621

0.002412

110−4

66

44

17

0.000420

0.000684

0.003223

110−5

141

54

21

0.000855

0.000746

0.003691

110−6

302

65

25

0.001784

0.000820

0.004325

110−7

649

76

29

0.003787

0.000900

0.004826

110−8

1398

87

33

0.008293

0.001003

0.005116