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.05\) for all \(n\in\mathbb {N}\) | |
---|---|---|
ε = 10−12 | Iteration | Approximate solution |
\(\beta_{n}=0.1\) | 99 | (0.99999999999927, 1.99999999999990, 3.00000000000052) |
\(\beta_{n}=1\) | 39 | (1.00000000000036, 2.00000000000048, 3.00000000000059) |
\(\beta_{n}=10\) | 15 | (1.00000000000018, 2.00000000000024, 3.00000000000030) |
\(\beta_{n}=20\) | 12 | (0.99999999999973, 1.99999999999964, 2.99999999999955) |
\(\beta_{n}=30\) | 11 | (1.00000000000013, 2.00000000000017, 3.00000000000021) |
\(\beta_{n}=40\) | 10 | (0.99999999999963, 1.99999999999952, 2.99999999999940) |
\(\beta_{n}=50\) | 10 | (0.99999999999995, 1.99999999999993, 2.99999999999992) |
\(\beta_{n}=100\) | 9 | (1.00000000000001, 2.00000000000002, 3.00000000000002) |
\(\beta_{n}=700\) | 7 | (1, 2, 3) |