![]() If you stay at the Eden Lancaster hotel, here is a The mini-course is organized by the Euler Institute for Discrete Mathematics and its Applications (ĮIDMA) and takes place at Centrum Wiskunde & Informatica Details about the restaurant will be posted later. A small example of an LP/SDP with YALMIP/Sedumi.Ī dinner will be organized on Thursday evening for all participants of the mini-course. Lecture Notes: Algebraic Optimization and Semidefinite Optimization. The morning program will start at 10h00 and the afternoon program might go up to 17h00.ġ0h00 - 12h30: Lectures (including a coffee/tea break).ġ4h30 - 17h00: Lectures/Exercises/Computer demos.įor the computer demos, please bring your laptop (with Matlab). Among the topics covered we will have: semidefinite relaxations, sum of squares representations, hyperbolic polynomials, SDP representability of convex sets, complex and real Nullstellensatz, convex algebraic geometry, sparsity and rank minimization problems, etc. We will use examples from several applied math and engineering areas, including systems and control, geometric theorem proving, and classical and quantum information theory. We will study both the complex and real cases, developing techniques of general applicability, and stressing convexity-based ideas, complexity results, and efficient implementations. The course will develop in a parallel fashion several algebraic and numerical approaches to polynomial systems, with a view towards methods that simultaneously incorporate both elements. This minicourse will focus on theoretical and computational techniques for optimization problems with algebraic structure (in particular, those involving polynomial equations and inequalities), emphasizing the connections with techniques based on semidefinite programming (SDP). Pablo Parrilo (MIT) May 31 - JHere and here are the group photos. ![]() EIDMA mini-course on Algebraic Optimization and Semidefinite ProgrammingĮIDMA mini-course Algebraic Optimization and Semidefinite Programming by ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |