Table 2 The values of \(\{x_{n}\}\) with \(x_{n}^{1}=-10\), \(x_{n}^{2}=10\), and \(n=N=400\)
From: An intermixed iteration for constrained convex minimization problem and split feasibility problem
n | \(x_{n}=(x_{n}^{1},x_{n}^{2})\) |
|---|---|
1 | (−10.0000,10.0000) |
2 | (−7.0308,8.9972) |
3 | (−5.2235,8.5685) |
4 | (−3.9531,8.2876) |
⋮ | ⋮ |
250 | (0.0000,-6.2974) |
⋮ | ⋮ |
396 | (0.0000,−9.9958) |
397 | (0.0000,−9.9958) |
398 | (0.0000,−9.9958) |
399 | (0.0000,−9.9958) |
400 | (0.0000,−9.9958) |