An Accelerated Proximal Algorithm for the Difference of Convex Programming

Table 2

Solving (35) on random instances, .

		Iter			CPU time
		GIST	APDCA	PDCA	GIST	APDCA	PDCA
720	2560	972	591	Max	1.5	0.7	5.4
1440	5120	968	602	Max	6.1	2.8	23.2
2160	7680	993	602	Max	13.6	6.1	50.2
2880	10240	835	602	Max	19.8	10.6	88.6
3600	12800	973	602	Max	36.1	16.7	139.8
4320	15360	931	602	Max	49.2	23.5	202.5
5040	17920	941	602	Max	67.5	32.6	296.4
5760	20480	979	602	Max	100.7	43.5	354.9
6480	23040	992	602	Max	116.3	54.9	449.8
7200	25600	939	602	Max	138.0	67.4	558.5
		Sparsity			Fval
		GIST	APDCA	PDCA	GIST	APDCA	PDCA
720	2560	728	703	927	6.2438e−2	6.2430e−2	7.6433e−2
1440	5120	1449	1381	1838	1.3160e−1	1.3159e−1	1.6346e−1
2160	7680	2168	2086	2810	2.0060e−1	2.0058ee−1	2.5146e−1
2880	10240	2853	2745	3618	2.3976e−1	2.3973e−1	2.7654e−1
3600	12800	3675	3557	4607	3.0264e−1	3.0260e−1	3.5620e−1
4320	15360	4368	4195	5523	3.9802e−1	3.9798e−1	4.7740e−1
5040	17920	5132	4925	6501	4.7413e−1	4.7407e−1	5.7676e−1
5760	20480	5825	5656	7358	5.3208e−1	5.3202e−1	6.3891e−1
6480	23040	6597	6311	8361	5.7707e−1	5.7699e−1	6.9385e−1
7200	25600	7270	7052	9269	6.4648e−1	6.4640e−1	7.7325e−1