Geodesically Convex Optimization - Can We Prove P!=NP Using Gradient Descent - Avi Wigderson

This course covers the topic of Geodesically Convex Optimization and explores the question of whether P can be proven to be different from NP using gradient descent. The course aims to teach the skills of understanding geodesically convex optimization, analyzing the matching problem, and implementing alternate minimization algorithms. The teaching method involves lectures and analysis of specific algorithms. This course is intended for individuals interested in computer science, discrete mathematics, and optimization theory.