From Differential Equation Solvers to Accelerated First-Order Methods for Convex Optimization 8: Semi-AFB for min over Q of h + g Contracts ℒ_k by 1/(1 + α_k) and Has the Rate of Theorem 5.1Research Paper
Many convex problems in signal processing, statistics and control have the composite form "smooth loss plus nonsmooth regulariser, subject to a simple constraint": a least-squares or entropy term , a sparsity or total-variation penalty , and a feasible set such as a box, a simplex or a cone. Accelerated proximal gradient methods (FISTA, Beck and…