Skip to main content

Table 2 Numerical comparisons with Ref. [12, 30] for Example 7

From: An accelerating algorithm for globally solving nonconvex quadratic programming

Dimension

Methods

Opt. val.

Iter.

Time (s)

n = 5

[12]

−25.0

141

10.11

[30]

−25.0

12

0.0187

ours

−25.0

1

0.01254

n = 10

[12]

−100.0

283

21.86

[30]

−100.0

31

0.3342

ours

−100.0

7

0.25649

n = 20

[12]

−400.0

651

47.00

[30]

−400.0

86

5.9396

ours

−400.0

15

2.73556

n = 30

[12]

−900.0

965

106.33

[30]

−900.0

204

44.8577

ours

−900.0

18

11.25635

n = 50

[12]

−2500.0

1891

304.30

ours

−2500.0

21

17.35219

n = 80

ours

−6400.0

37

40.45623

n = 100

ours

−10,000.0

51

44.35865

n = 150

ours

−22,500.0

66

112.99298