Lin, Qihang; Xiao, Lin - In: Computational Optimization and Applications 60 (2015) 3, pp. 633-674
<Para ID="Par1">We consider optimization problems with an objective function that is the sum of two convex terms: one is smooth and given by a black-box oracle, and the other is general but with a simple, known structure. We first present an accelerated proximal gradient (APG) method for problems where the...</para>