Journal of Inequalities and Applications

Table 1 Iteration number and CPU computing time of Algorithm 1 with different dimensions

From: An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems

n	100	300	500	700	900	1000	1500
Iter.	57	110	245	317	357	368	564
Initer.	936	1110	2074	2243	2320	2391	2434
Time (s)	0.04	0.08	0.29	0.64	1.07	1.80	4.59

Back to article page