From: A global QP-free algorithm for mathematical programs with complementarity constraints
Problem | dim | \(f_{\mathrm{opt}}\) | Algorithm A | filtermpec | snopt | loqo | knitro | |
---|---|---|---|---|---|---|---|---|
\(f^{*}\) | itr | itr | itr | itr | itr | |||
bard3m | 6 | −12.6787 | −12.6787 | 38 | 4 | 10 | 23 | 66 |
flp2 | 4 | 0 | 6.2848e − 11 | 9 | – | – | – | – |
gauvin | 3 | 20 | 20.0000 | 34 | 7 | 10 | 20 | 29 |
kth2 | 2 | 0 | −5.2411e − 06 | 12 | 2 | 4 | 11 | 7 |
kth3 | 2 | 0.5 | 0.5000 | 5 | 4 | 6 | 10 | 22 |
scholtes2 | 3 | 15 | 14.4898 | 15 | 2 | 3 | 11 | 16 |
scholtes3 | 2 | 0.5 | 0.5000 | 6 | 4 | 0 | 29 | 10 |
scholtes5 | 3 | 1.0 | 1.0000 | 8 | 1 | 3 | 10 | 8 |