Research Article

A Novel Optimization Method for Nonconvex Quadratically Constrained Quadratic Programs

Table 2

Numerical results for Examples 46.

Example Refs. ( ) Optimal solution Optimal value Iter Time (s)

4 our1 (0, 0, 0)(2.0, 1.0) −1.000000 0 0.00071504
our2 (0, 0, 1)(2.0, 1.0) −1.000000000 1 0.00165866
our3 (0, 1, 1)(2.0, 1.0) −1.000000000 2 0.00169589
our4 (1, 1, 1)(2.0, 1.0) −1.000000000 2 0.00156529
our5 (1, 0, 0)(2.0, 1.0) −1.000000000 2 0.00153087
our6 (1, 0, 1)(2.0, 1.0) −1.000000000 2 0.00159881
our7 (1, 1, 0)(2.0, 1.0) −1.000000000 2 0.00158519
our8 (0, 1, 0)(2.0, 1.0) −1.000000 0 0.00066607
[21] (2.0, 1.0) −0.999999410 21 0.00849446
[23] (2.0, 1.0) −1.024 0.0116923

5 our1 (0, 0) (2.555409888, 3.130613160) 118.383672050 49 0.0271463
our2 (0, 1) (2.555676683, 3.130286407) 118.383672115 51 0.0287108
our3 (1, 1) (2.555800904, 3.130134268) 118.383672231 61 0.0350215
our4 (1, 0) (2.555775920, 3.130164866) 118.383671937 55 0.030462
[17] (2.555779370, 3.130164640)118.383756475 210 0.78
[21] (2.555745855, 3.130201688) 118.383671904 59 0.0385038

6 our1 (0, 0, 0)(1.0, 0.181818247, 0.983332154) −11.363635387 141 0.110562
our2 (0, 0, 1)(1.0, 0.181818217, 0.983332160) −11.363636364 240 0.198587
our3 (0, 1, 1)(1.0, 0.181818196, 0.983332163) −11.363635785 260 0.213692
our4 (1, 1, 1)(1.0, 0.181818133, 0.983332175) −11.363635682 229 0.18844
our5 (1, 0, 0) (1.0, 0.181783067, 0.983338664)−11.363635889 80 0.0669022
our6 (1, 0, 1)(1.0, 0.181818133, 0.983332175) −11.363635715 213 0.176459
our7 (1, 1, 0)(1.0, 0.181818301, 0.983332144) −11.363635516 149 0.131391
our8 (0, 1, 0)(1.0, 0.181818133, 0.983332175) −11.363636364 133 0.105004
[21] (1.0, 0.181818470, 0.983332113)−11.363636364 420 0.284541
[25] (0.998712, 0.196213, 0.979216) −10.35 1648 0.3438