CCCP is Frank-Wolfe in Disguise - Connecting Optimization Methods
Offered By: Erwin Schrödinger International Institute for Mathematics and Physics (ESI) via YouTube
Course Description
Overview
Discover the surprising connection between the convex-concave procedure (CCCP) and the Frank-Wolfe (FW) method in this 24-minute conference talk from the Workshop on "One World Optimization Seminar in Vienna" at the Erwin Schrödinger International Institute for Mathematics and Physics. Explore how CCCP and its generalization to constrained problems are special cases of the Frank-Wolfe method, providing deep pedagogical insights and transferring nonconvex Frank-Wolfe convergence theory to CCCP. Learn how this perspective may facilitate the application of other FW advances to CCCP and its generalizations, potentially advancing the field of optimization.
Syllabus
Alp Yurtsever - CCCP is Frank-Wolfe in disguise
Taught by
Erwin Schrödinger International Institute for Mathematics and Physics (ESI)
Related Courses
Information TheoryThe Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera