Algorithm 2.

Accelerated Projected Gradient (AG) Method

1:	Input: T0, $L_0\in \mathbb{R}$, and max-iter.
2:	Output: T.
3:	Set T1 = T0, t–1 = 0, and t0 = 1.
4:	for i = 1, 2, · · · , max-iter do
5:	Compute α = (ti–2– 1)/ti–1.
6:	Compute S = (1 + αi)Ti – αiTi–1
7:	while (true)
8:	Compute T̂ = TLi,S via Eq. (11).
9:	if F(T̂) ≤ GLi (S, T̂) then exit the loop
10:	else update Li = Li × 2.
11:	end-if
12:	end-while
13:	Update Ti+1 = T̂ and Li+1 = Li.
14:	if the stopping criterion is satisfied then exit the loop.
15:	Update $t_i=\frac{1}{2}(1+\sqrt{1+4t_{i-1}^2})$.
16:	end-for
17:	Set T = Ti+1.