From: An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
Problem | n | Algorithm | NI | ND | NF | \(F^{*}\) |
---|---|---|---|---|---|---|
CB2 | 2 | Algorithm 1 | 2 | 1 | 2 | 3.343146 |
PPBM | 2 | 1 | 2 | 3.343146 | ||
CB3 | 2 | Algorithm 1 | 9 | 4 | 9 | 24.479795 |
PPBM | 11 | 8 | 11 | 24.479795 | ||
LQ | 2 | Algorithm 1 | 15 | 12 | 15 | −0.999989 |
PPBM | 18 | 17 | 18 | −0.999996 | ||
Mifflin1 | 2 | Algorithm 1 | 3 | 2 | 3 | 48.153612 |
PPBM | 4 | 2 | 4 | 48.153612 | ||
Rosen–Suzuki | 4 | Algorithm 1 | 7 | 6 | 7 | 39.715617 |
PPBM | 9 | 8 | 9 | 39.715617 | ||
Shor | 5 | Algorithm 1 | 5 | 1 | 5 | 50.250278 |
PPBM | 4 | 1 | 4 | 50.250278 | ||
MAXL | 20 | Algorithm 1 | 19 | 6 | 19 | 0.552786 |
PPBM | 22 | 2 | 22 | 0.552786 |