Skip to main content

Table 1 The performance of the three iterative algorithms solving the LASSO in terms of the objective function values

From: Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size

Problem size

Sparse level

Methods

Objective function values

m = 120, n = 512

K = 10

Byrne [4]

1.2608e − 08

Lopez et al. [8]

2.4775e − 08

Iterative sequence (17)

2.8735e − 10

K = 20

Byrne [4]

8.0515e − 08

Lopez et al. [8]

1.3245e − 08

Iterative sequence (17)

3.0803e − 10

m = 240, n = 1,024

K = 10

Byrne [4]

1.2997e − 08

Lopez et al. [8]

4.0332e − 08

Iterative sequence (17)

5.2898e − 10

K = 20

Byrne [4]

2.5992e − 08

Lopez et al. [8]

5.9182e − 08

Iterative sequence (17)

5.5932e − 10

K = 30

Byrne [4]

5.4290e − 08

Lopez et al. [8]

1.3325e − 07

Iterative sequence (17)

6.1643e − 10