An Accelerated Proximal Algorithm for the Difference of Convex Programming

Table 1

Solving (35) on random instances, .

		Iter			CPU time
		GIST	APDCA	PDCA	GIST	APDCA	PDCA
720	2560	1750	909	Max	3.57	1.38	7.37
1440	5120	1629	802	Max	13.7	5.0	31.8
2160	7680	1724	802	Max	28.5	10.0	62.2
2880	10240	1742	1002	Max	52.8	22.3	112.2
3600	12800	1799	1002	Max	83.8	34.3	174.7
4320	15360	1739	1002	Max	113.7	48.9	246.5
5040	17920	1778	1002	Max	160.7	66.9	334.5
5760	20480	1826	1002	Max	178.3	71.5	366.1
6480	23040	1778	975	Max	244.3	100.5	524.1
7200	25600	1752	975	Max	317.4	130.9	692.6
		Sparsity			Fval
		GIST	APDCA	PDCA	GIST	APDCA	PDCA
720	2560	783	761	1132	2.9755e−2	2.9743e−2	4.5442e−2
1440	5120	1575	1614	2240	6.1144e−2	6.1122e−2	9.4466e−2
2160	7680	2367	2424	3425	9.4648e−2	9.4612e−2	1.4594e−1
2880	10240	3117	2910	4496	1.2312e−1	1.2308e−1	1.8319e−1
3600	12800	3889	3644	5707	1.5896e−1	1.5890e−1	2.4309e−1
4320	15360	4766	4376	6720	1.8879e−1	1.8869e−1	2.8401e−1
5040	17920	5497	5141	7911	2.2523e−1	2.2512e−1	3.4175e−1
5760	20480	6327	5931	9181	2.6870e−1	2.6859e−1	4.1224e−1
6480	23040	7065	6716	10184	2.9070e−1	2.9098e−1	4.3889e−1
7200	25600	7865	7449	11286	3.2206e−1	3.2191e−1	4.8588e−1