A Novel Optimization Method for Nonconvex Quadratically Constrained Quadratic Programs

Table 3

Numerical comparisons with Refs. [16, 21] for Example 9.

Refs.	Number of variable	𝑛=5	𝑛=10	𝑛=20	𝑛=30
Ours	Computational time (s)	0.0124692	0.215709	3.69194	27.4522
	Iteration Number	12	31	86	204
Ref. [16]	Computational time (s)	10.11	21.86	47.00	106.33
	Iteration Number	141	283	651	965
Ref. [21]	Computational time (s)	0.0181791	0.302157	6.01095	44.4965
	Iteration Number	12	32	88	206