CCCP is Frank-Wolfe in Disguise - Connecting Optimization Methods
Erwin Schrödinger International Institute for Mathematics and Physics (ESI) via YouTube
Learn EDR Internals: Research & Development From The Masters
Become an AI & ML Engineer with Cal Poly EPaCE — IBM-Certified Training
Overview
Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
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)