A Novel Optimization Method for Nonconvex Quadratically Constrained Quadratic Programs

Table 1

Numerical results for Examples 1–3.

Example	Refs.	(𝜃0,…,𝜃𝑚)	Optimal solution	Optimal value	Iter	Time (s)
1	our1	(0, 0, 0)	(5.0, 1.0)	−16.000000000	3	0.00190359
	our2	(0, 0, 1)	(5.0, 1.0)	−16.000000000	2	0.000975264
	our3	(0, 1, 1)	(5.0, 1.0)	−16.000000000	2	0.000958502
	our4	(1, 1, 1)	(5.0, 1.0)	−16.000000000	3	0.00115294
	our5	(1, 0, 0)	(5.0, 1.0)	−16.000000000	4	0.0013566
	our6	(1, 0, 1)	(5.0, 1.0)	−16.000000000	3	0.00114037
	our7	(1, 1, 0)	(5.0, 1.0)	−16.000000000	4	0.00142281
	our8	(0, 1, 0)	(5.0, 1.0)	−16.000000000	3	0.00108701
	[32]		(5.0, 1.0)	−16.0	20	0.175
	[21]		(5.0, 1.0)	−16.0	5	0.00184588
2	our1	(0, 0)	(2.0, 1.666666667)	6.777778018	32	0.00662822
	our2	(0, 1)	(2.0, 1.666666667)	6.777778233	32	0.00665057
	our3	(1, 1)	(2.0, 1.666666667)	6.777778517	33	0.00698972
	our4	(1, 0)	(2.0, 1.666666667)	6.777778743	32	0.00685227
	[19]		(2.0, 1.666666667)	6.777782016	40	0.032
	[22]		(2.00003, 1.66665)	6.7780	44	0.18
3	our1	(0, 0, 0)	(0.5, 0.5)	0.500000000	25	0.0065648
	our2	(0, 0, 1)	(0.5, 0.5)	0.500000000	25	0.00733278
	our3	(0, 1, 1)	(0.5, 0.5)	0.500000600	26	0.00686791
	our4	(1, 1, 1)	(0.5, 0.5)	0.500000600	26	0.00691568
	our5	(1, 0, 0)	(0.5, 0.5)	0.500000000	25	0.00735261
	our6	(1, 0, 1)	(0.5, 0.5)	0.500000000	25	0.00736742
	our7	(1, 1, 0)	(0.5, 0.5)	0.500000600	26	0.00769232
	our8	(0, 1, 0)	(0.5, 0.5)	0.500000600	26	0.00921374
	[19]		(0.5, 0.5)	0.500004627	34	0.056
	[21]		(0.5, 0.5)	0.500000442	37	0.0192625
	[22]		(0.5, 0.5)	0.5	91	0.85