Table 6:

CPU times and optima for testing the copositivity of random symmetric matrices. Here n is the size of matrix, PD is the proximal distance algorithm, aPD is the accelerated proximal distance algorithm, and Mosek is the Mosek solver.

Dimension	Optima			CPU Seconds
n	PD	aPD	Mosek	PD	aPD	Mosek
4	−0.391552	−0.391561	infeasible	0.0029	0.0031	0.0024
8	−0.911140	−2.050316	infeasible	0.0037	0.0044	0.0045
16	−1.680697	−1.680930	infeasible	0.0199	0.0272	0.0062
32	−2.334520	−2.510781	infeasible	0.0261	0.0242	0.0441
64	−3.821927	−3.628060	infeasible	0.0393	0.0437	0.6559
128	−5.473609	−5.475879	infeasible	0.0792	0.0798	38.3919
256	−7.956365	−7.551814	infeasible	0.1632	0.1797	456.1500