We uncover a simple but rather surprising connection: the well-known convex-concave procedure (CCCP) and its generalization to constrained problems are both special cases of the Frank-Wolfe (FW) method. This connection not only provides insight of deep (in our opinion) pedagogical value, but also transfers the convergence theory of nonconvex Frank-Wolfe methods immediately to CCCP. We hope the viewpoint spurs the transfer of other advances made for FW to both CCCP and its generalizations.