Table 2 Numerical results of NCM
From: A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
n | m | \(x^{0}\) | Algorithm | A-Iter |
|---|---|---|---|---|
10 | 5 |  | Algorithm A | 5 |
\((0.5,\ldots,0.5)^{\mathrm{T}}\) | Algorithm in [31] | 8 | ||
| Â | Algorithm in [13] | 9 | ||
45 | 10 |  | Algorithm A | 15 |
\((0.5,\ldots,0.5)^{\mathrm{T}}\) | Algorithm in [31] | 8 | ||
| Â | Algorithm in [13] | 10 | ||
105 | 15 |  | Algorithm A | 4 |
\((0.5,\ldots,0.5)^{\mathrm{T}}\) | Algorithm in [31] | 10 | ||
|  | Algorithm in [13] | 11 | ||
190 | 20 |  | Algorithm A | 2 |
\((0.5,\ldots,0.5)^{\mathrm{T}}\) | Algorithm in [31] | 11 | ||
| Â | Algorithm in [13] | 12 |