Skip to main content

Table 1 Computational Results for Example 1

From: Self-adaptive forward–backward splitting algorithm for the sum of two monotone operators in Banach spaces

Algorithms

Tolerance (TOL)

(\(\theta, \lambda _{n}, \lambda \))

No. of Iter.

Time (s)

Algorithm (3.1)

TOL = 10−4

θ = 0.4

40

16.9233

Tam

 

\(\lambda _{n} = 0.125+(0.01562)n^{-1}\)

41

12.3243

Tseng

 

λ = 0.1406

400

134.3984

Algorithm (3.1)

TOL = 10−4

θ = 0.4

46

16.0526

Tam

 

\(\lambda _{n} = 0.01+(0.2)n^{-1}\)

329

113.968

Tseng

 

λ = 0.2100

400

82.4403

Algorithm (3.1)

TOL = 9 × 10−3

θ = 0.01

238

115.2452

Tam

 

\(\lambda _{n} = 0.125+(0.01562)n^{-1}\)

21

9.2270

Tseng

 

λ = 0.1406

400

125.1663

Algorithm (3.1)

TOL = 9 × 10−3

θ = 0.01

244

107.1992

Tam

 

\(\lambda _{n} = 0.01+(0.2)n^{-1}\)

122

52.6718

Tseng

 

λ = 0.2100

400

94.7951