Skip to main content

Table 1 Numerical results as regards Example  1

From: Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem

n

\(\boldsymbol{x_{n}^{1}}\)

\(\boldsymbol{x_{n}^{2}}\)

\(\boldsymbol{x_{n}^{3}}\)

\(\boldsymbol{x_{n}^{4}}\)

\(\boldsymbol{E_{n}}\)

0

1.0000

1.0000

1.0000

1.0000

5.74E + 00

100

1.2292

2.8506

1.8424

4.0887

3.28E − 01

1,000

1.2208

2.9107

1.8691

4.0722

2.81E − 01

5,000

1.1128

2.9543

1.9331

4.0369

1.42E − 01

10,000

1.0298

2.9880

1.9824

4.0097

3.79E − 02