Table 1 Numerical results
From: A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
Problem | n | m | \(x^{0}\) | Algorithm A | Algorithm [30] | ||||
|---|---|---|---|---|---|---|---|---|---|
Iter | time (s) | \(f_{\mathrm{final}}\) | Iter | time (s) | \(f_{\mathrm{final}}\) | ||||
Problem 1 | 2 | 2 | (1,2) | 9 | 1.43 | −2.000 | 10 | 1.12 | −2.000 |
2 | 2 | (−5,4) | 9 | 1.24 | −2.000 | 11 | 1.08 | −2.000 | |
2 | 2 | (−4,−2) | 10 | 1.04 | −2.000 | 10 | 1.01 | −2.000 | |
2 | 2 | (−4,5) | 9 | 1.16 | −2.000 | 9 | 1.26 | −2.000 | |
2 | 2 | (10,−10) | 7 | 1.36 | −2.000 | 4 | 0.32 | −1.102 | |
2 | 2 | (2,1) | 11 | 1.35 | −2.000 | 4 | 0.30 | −2.244 | |
2 | 2 | (1,−10) | 8 | 0.91 | −2.000 | 3 | 0.45 | −1.891 | |
Problem 2 | 2 | 2 | (1,1) | 2 | 0.68 | 7.389 | 3 | 0.35 | 7.389 |
2 | 2 | (1,−7) | 5 | 0.93 | 7.389 | 5 | 0.79 | 7.389 | |
2 | 2 | (9,−11) | 6 | 0.91 | 7.389 | 6 | 0.81 | 7.389 | |
2 | 2 | (1,5) | 6 | 1.43 | 7.389 | 9 | 1.12 | 7.389 | |
2 | 2 | (1,4) | 5 | 0.72 | 7.389 | 4 | 1.04 | 5.431 | |
2 | 2 | (0,4) | 6 | 0.78 | 7.389 | 4 | 0.58 | 8.175 | |
2 | 2 | (0,2) | 5 | 0.61 | 7.389 | 3 | 0.43 | 7.842 | |