Lecture
This lecture covers the complexity analysis of the FGD algorithm when applied to a sum of n functions, focusing on deriving a closed form expression for the average at each iteration and discussing the computational complexity and memory requirements in big O notation.