New Hybrid Steepest Descent Algorithms for Equilibrium Problem and Infinitely Many Strict Pseudo-Contractions in Hilbert Spaces

Table 2

(a) 𝑥⁽¹⁾=(1,0)^⊤. (b) 𝑥⁽¹⁾=(1,0)^⊤.

(a)

𝑛 (iterative number)	𝑥^(1) (initial guess)	Errors (𝑛)
10	(0.8289, 0.5521)	4.6×10^−3
50	(0.8308, 0.5559)	3.8×10^−4
100	(0.8310, 0.5561)	1.9×10^−4

(b)

𝑛 (iterative number)	𝑥^(1) (initial guess)	Errors (𝑛)
10	(0.8271, 0.5521)	5.6×10^−3
50	(0.8308, 0.5558)	4.7×10^−4
100	(0.8309, 0.5561)	2.2×10^−4