From: An intermixed iteration for constrained convex minimization problem and split feasibility problem
n | \(x_{n}=(x_{n}^{1},x_{n}^{2})\) | \(y_{n}=(y_{n}^{1},y_{n}^{2})\) |
---|---|---|
1 | (−10.0000,10.0000) | (10.0000,−10.0000) |
2 | (−6.0784,8.0448) | (8.1639,−7.2059) |
3 | (−4.2192,7.3380) | (7.5048,−5.8538) |
4 | (−3.0380,6.9152) | (7.1109,−4.9143) |
⋮ | ⋮ | ⋮ |
250 | (−0.0050,−7.7785) | (−7.5696,−0.0076) |
⋮ | ⋮ | ⋮ |
396 | (−0.0043,−9.9937) | (−9.9937,−0.0065) |
397 | (−0.0042,−9.9937) | (−9.9937,−0.0064) |
398 | (−0.0042,−9.9937) | (−9.9937,−0.0064) |
399 | (−0.0042,−9.9937) | (−9.9937,−0.0064) |
400 | (−0.0042,−9.9937) | (−9.9937,−0.0064) |