From: A globally convergent QP-free algorithm for nonlinear semidefinite programming
Problem | n | l | m | \(\boldsymbol{x^{0}}\) | Iter. | NF | NC | \(\boldsymbol{f_{\mathrm {final}}}\) | Time (s) |
---|---|---|---|---|---|---|---|---|---|
CM | 4 | 3 | 4 | \((2.5, 2.5, 2.5, -2.5)^{\mathrm{T}}\) | 19 | 72 | 72 | −4.400000e + 001 | 4.097408e − 001 |
PHS6 | 2 | 1 | 2 | \((-2, -2)^{\mathrm{T}}\) | 99 | 128 | 128 | 1.226381e − 006 | 3.541575e − 001 |
PHS7 | 2 | 1 | 2 | \((1,5)^{\mathrm{T}}\) | 43 | 169 | 169 | −1.732051e + 000 | 3.551911e − 001 |
PHS8 | 2 | 2 | 2 | \((1,4)^{\mathrm{T}}\) | 4 | 4 | 4 | −1 | 2.195229e − 001 |
PHS9 | 2 | 1 | 2 | \((-4,4)^{\mathrm{T}}\) | 2 | 2 | 2 | −4.999996e − 001 | 2.025914e − 001 |
PHS26 | 3 | 1 | 3 | \((1.5,1.5,1.5)^{\mathrm{T}}\) | 28 | 28 | 28 | 3.726010e − 005 | 2.514937e − 001 |
PHS27 | 3 | 1 | 3 | \((-1,1,1)^{\mathrm{T}}\) | 17 | 17 | 17 | 5.426241e − 002 | 2.354974e − 001 |
PHS28 | 3 | 1 | 3 | \((1,-1,-1)^{\mathrm{T}}\) | 6 | 6 | 6 | 6.756098e − 001 | 1.708627e − 001 |
PHS40 | 4 | 3 | 4 | \((0.5,0.5,0.5,0.5)^{\mathrm{T}}\) | 8 | 10 | 10 | −2.500001e − 001 | 2.773717e − 001 |
PHS42 | 4 | 2 | 4 | \((-1,1,1,1)^{\mathrm{T}}\) | 17 | 28 | 28 | 1.385766e + 001 | 2.415490e − 001 |
PHS47 | 5 | 3 | 4 | \((-1,1,1,1,1)^{\mathrm{T}}\) | 31 | 80 | 80 | 2.910505e − 001 | 2.642828e − 001 |
PHS48 | 5 | 2 | 4 | \((3,3,3,3,-3)^{\mathrm{T}}\) | 49 | 140 | 140 | 3.060758e − 008 | 2.962501e − 001 |
PHS50 | 5 | 3 | 4 | \((-3,3,3,3,3)^{\mathrm{T}}\) | 23 | 84 | 84 | 2.390072e − 009 | 3.139633e − 001 |
PHS51 | 5 | 3 | 4 | \((-1,1,1,1,1)^{\mathrm{T}}\) | 13 | 14 | 14 | 4.687353e − 008 | 2.302719e − 001 |
PHS61 | 3 | 2 | 3 | \((2.5,2.5,2.5)^{\mathrm{T}}\) | 59 | 59 | 59 | −8.191909e + 001 | 3.401501e − 001 |
PHS77 | 5 | 2 | 4 | \((1,1,1,1,1)^{\mathrm{T}}\) | 23 | 25 | 25 | 2.415051e − 001 | 2.393263e − 001 |
PHS79 | 5 | 3 | 4 | \((-1,1,1,1,1)^{\mathrm{T}}\) | 44 | 50 | 50 | 7.877716e − 002 | 3.415668e − 001 |