Research Article

An Accelerated Proximal Algorithm for the Difference of Convex Programming

Table 4

Solving (40) on random instances, .

IterCPU time
GISTAPDCAPDCAGISTAPDCAPDCA

720256049732946580.90.45.2
1440512046840245823.11.920.5
2160768049640247396.84.046.8
288010240472402452711.17.079.5
360012800494402460118.311.1126.5
432015360505402460226.616.5179.0
504017920451402442831.821.3234.7
576020480448402444641.227.7304.2
648023040459402460252.835.0403.6
720025600487402466870.744.0510.4

SparsityFval
GISTAPDCAPDCAGISTAPDCAPDCA

72025606286356587.5032e−27.5032e−27.5053e−2
144051201300124813371.4892e−11.4891e−11.4896e−1
216076801987186519652.3348e−12.3347e−12.3354e−1
2880102402543246226273.0410e−13.0410e−13.0416e−1
3600128003156307232523.8829e−13.8828e−13.8837e−1
4320153603831370339734.5346e−14.5344e−14.5348e−1
5040179204460430046055.2664e−15.2662e−15.2676e−1
5760204805124499152685.9404e−15.9402e−15.9417e−1
6480230405761554059196.8740e−16.8737e−16.8756e−1
7200256006365623166327.6681e−17.6678e−17.6700e−1