Table 1 Results for Example
From: Hybrid CQ projection algorithm with line-search process for the split feasibility problem
Initiative point | Algorithm 3.1 \(\boldsymbol{^{\ast}}\) with β  = 1 | Algorithm 3.1 |
|---|---|---|
\(x^{0}=(3,2,0)\) | Iter = 78; CPU (s)=0.113 | Iter = 43; CPU (s)=0.098 |
\(x^{\ast}=(0.0238,0.0581,-0.1203)\) | \(x^{\ast}=(1.0512;-2.3679; 1.0613)\) | |
\(x^{0}=(0,-4,0)\) | Iter = 39; CPU (s)=0.096 | Iter = 20; CPU (s)=0.053 |
\(x^{\ast}=(-0.1608,-0.5033,0.8663)\) | \(x^{\ast}=(-2.0711,1.2634,2.1036)\) |