Exploiting Sparsity in Polynomial Optimization - Lecture 2
Offered By: Centre International de Rencontres Mathématiques via YouTube
Course Description
Overview
Explore advanced techniques in polynomial optimization with a focus on exploiting sparsity in this comprehensive lecture. Delve into the second part of Victor Magron's presentation, delivered during the "Francophone Computer Algebra Days" at the Centre International de Rencontres Mathématiques in Marseille, France. Gain insights into cutting-edge mathematical concepts and their applications in computer algebra. Access this 1 hour and 29 minutes long recording through CIRM's Audiovisual Mathematics Library, which offers enhanced features such as chapter markers, keywords, abstracts, bibliographies, and Mathematics Subject Classification. Utilize the multi-criteria search function to discover related content and expand your knowledge in this specialized field of mathematics.
Syllabus
Victor Magron : Exploiting sparsity in polynomial optimization Lecture 2
Taught by
Centre International de Rencontres Mathématiques
Related Courses
Graph Partitioning and ExpandersStanford University via NovoEd Convex Optimization
Stanford University via edX Approximation Algorithms Part II
École normale supérieure via Coursera The State of JuMP - Progress and Future Plans
The Julia Programming Language via YouTube Quantum Algorithms for Optimization - Quantum Colloquium
Simons Institute via YouTube