Skip to main content

Table 2 Computational Results for Example 2

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−5

θ = 0.4

50

0.0693

Tam

 

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

52

0.0027

Tseng

 

λ = 0.1406

45

0.0332

Algorithm (3.1)

TOL = 10−5

θ = 0.4

58

0.0602

Tam

 

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

440

0.0222

Tseng

 

λ = 0.2100

34

0.0328

Algorithm (3.1)

TOL = 10−5

θ = 0.01

538

0.1166

Tam

 

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

52

0.0043

Tseng

 

λ = 0.1406

45

0.0346

Algorithm (3.1)

TOL = 10−5

θ = 0.01

540

0.1130

Tam

 

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

440

0.0226

Tseng

 

λ = 0.2100

34

0.0336