Skip to main content

Table 4 Numerical results for Example 4.2.

From: Split proximal linearized algorithm and convergence theorems for the split DC program

Algorithm 3.1

\(x_{1}=(123,456,789)\), and \(r_{n}=0.09\) for all \(n\in\mathbb {N}\)

ε = 10−12

Iteration

Approximate solution

\(\beta_{n}=0.1\)

98

(0.99999999999931, 1.99999999999990, 3.00000000000050)

\(\beta_{n}=1\)

283

(1.00000000000038, 2.00000000000051, 3.00000000000063)

\(\beta_{n}=10\)

21

(1.00000000000008, 2.00000000000010, 3.00000000000013)

\(\beta_{n}=20\)

15

(1.00000000000042, 2.00000000000056, 3.00000000000069)

\(\beta_{n}=30\)

14

(0.99999999999997, 1.99999999999996, 2.99999999999995)

\(\beta_{n}=40\)

12

(0.99999999999959, 1.99999999999946, 2.99999999999933)

\(\beta_{n}=50\)

12

(0.99999999999996, 1.99999999999995, 2.99999999999994)

\(\beta_{n}=100\)

10

(0.99999999999994, 1.99999999999992, 2.99999999999990)

\(\beta_{n}=1300\)

7

(1, 2, 3)