{"id":2048,"date":"2015-10-16T14:16:12","date_gmt":"2015-10-16T12:16:12","guid":{"rendered":"http:\/\/www.mi.uni-koeln.de\/opt\/?page_id=2048"},"modified":"2015-10-16T15:38:45","modified_gmt":"2015-10-16T13:38:45","slug":"convex-optimization-lectures","status":"publish","type":"page","link":"http:\/\/www.mi.uni-koeln.de\/opt\/veranstaltungen\/konvexe-optimierung\/convex-optimization-lectures\/","title":{"rendered":"Lectures"},"content":{"rendered":"<p>Hand-written lecture notes:<br \/>\n\n<table id=\"tablepress-11\" class=\"tablepress tablepress-id-11\">\n<thead>\n<tr class=\"row-1\">\n\t<th class=\"column-1\">Date<\/th><th class=\"column-2\">Notes<\/th><th class=\"column-3\">Table of contents<\/th>\n<\/tr>\n<\/thead>\n<tbody class=\"row-striping row-hover\">\n<tr class=\"row-2\">\n\t<td class=\"column-1\">20.10.<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/10\/CO2015-16-VL01.pdf\">Lecture 1<\/a><\/td><td class=\"column-3\"><b>Chapter I: Introduction<\/b><br \/>\n <\/td>\n<\/tr>\n<tr class=\"row-3\">\n\t<td class=\"column-1\">22.10.<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/10\/CO2015-16-VL02.pdf\">Lecture 2<\/a><\/td><td class=\"column-3\"><b>Chapter II: Minimizing a convex function<\/b><\/td>\n<\/tr>\n<tr class=\"row-4\">\n\t<td class=\"column-1\">27.10.<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/10\/CO2015-16-VL03.pdf\">Lecture 3<\/a><\/td><td class=\"column-3\"><b>Chapter III: Conic Optimization<\/b><br \/>\n&sect;1 Convex cones<\/td>\n<\/tr>\n<tr class=\"row-5\">\n\t<td class=\"column-1\">29.10<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/10\/CO2015-16-VL04.pdf\">Lecture 4<\/a><\/td><td class=\"column-3\">&sect;2 The PSD cone<\/td>\n<\/tr>\n<tr class=\"row-6\">\n\t<td class=\"column-1\">3.11<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/11\/CO2015-16-VL05.pdf\">Lecture 5<\/a><\/td><td class=\"column-3\">&sect;3 Conic programs<\/td>\n<\/tr>\n<tr class=\"row-7\">\n\t<td class=\"column-1\">5.11<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/11\/CO2015-16-VL06.pdf\">Lecture 6<\/a><\/td><td class=\"column-3\">&sect;4 Theorem of alternatives<\/td>\n<\/tr>\n<tr class=\"row-8\">\n\t<td class=\"column-1\">10.11<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/11\/CO2015-16-VL07.pdf\">Lecture 7<\/a><\/td><td class=\"column-3\"><\/td>\n<\/tr>\n<tr class=\"row-9\">\n\t<td class=\"column-1\">12.11<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/11\/CO2015-16-VL08.pdf\">Lecture 8<\/a><\/td><td class=\"column-3\">&sect;5 Duality theory<\/td>\n<\/tr>\n<tr class=\"row-10\">\n\t<td class=\"column-1\">17.11<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/11\/CO2015-16-VL09.pdf\">Lecture 9<\/a><\/td><td class=\"column-3\"><b>Chapter IV: First applications<\/b><br \/>\n&sect;1 Robust optimization<\/td>\n<\/tr>\n<tr class=\"row-11\">\n\t<td class=\"column-1\">19.11<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/11\/CO2015-16-VL10.pdf\">Lecture 10<\/a><\/td><td class=\"column-3\">&sect;2 Eigenvalue optimization<\/td>\n<\/tr>\n<tr class=\"row-12\">\n\t<td class=\"column-1\">24.11<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/11\/CO2015-16-VL11.pdf\">Lecture 11<\/a><\/td><td class=\"column-3\">&sect;3 SDP relaxations of quadratic programs<br \/>\n<b>Chapter V: Approximation algorithms<\/b><br \/>\n&sect;1 MAX CUT<\/td>\n<\/tr>\n<tr class=\"row-13\">\n\t<td class=\"column-1\">26.11<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/12\/CO2015-16-VL12.pdf\">Lecture 12<\/a><\/td><td class=\"column-3\"><\/td>\n<\/tr>\n<tr class=\"row-14\">\n\t<td class=\"column-1\">1.12<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/12\/CO2015-16-VL13.pdf\">Lecture 13<\/a><\/td><td class=\"column-3\"><\/td>\n<\/tr>\n<tr class=\"row-15\">\n\t<td class=\"column-1\">3.12<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/12\/CO2015-16-VL14.pdf\">Lecture 14<\/a><\/td><td class=\"column-3\">&sect;2 Eigenvalue interpretation of the SDP relaxation for MAX CUT<br \/>\n&sect;3 Little Grothendieck inequality \/ Nesterov's approximation algorithm<\/td>\n<\/tr>\n<tr class=\"row-16\">\n\t<td class=\"column-1\">8.12<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/12\/CO2015-16-VL15.pdf\">Lecture 15<\/a><\/td><td class=\"column-3\">&sect;4 Grothendieck's inequality<\/td>\n<\/tr>\n<tr class=\"row-17\">\n\t<td class=\"column-1\">10.12<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/12\/CO2015-16-VL16.pdf\">Lecture 16<\/a><\/td><td class=\"column-3\"><b>Chapter VI: Determinant Maximization<\/b><br \/>\n&sect;1 Convex spectral functions<\/td>\n<\/tr>\n<tr class=\"row-18\">\n\t<td class=\"column-1\">15.12<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/12\/CO2015-16-VL17.pdf\">Lecture 17<\/a><\/td><td class=\"column-3\">&sect;2 MAXDET optimization<\/td>\n<\/tr>\n<tr class=\"row-19\">\n\t<td class=\"column-1\">17.12<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/12\/CO2015-16-VL18.pdf\">Lecture 18<\/a><\/td><td class=\"column-3\"><\/td>\n<\/tr>\n<tr class=\"row-20\">\n\t<td class=\"column-1\">22.12<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/12\/CO2015-16-VL19.pdf\">Lecture 19<\/a><\/td><td class=\"column-3\">&sect;3 Approximation of polytopes by ellipsoids<\/td>\n<\/tr>\n<tr class=\"row-21\">\n\t<td class=\"column-1\">7.1<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2016\/01\/CO2015-16-VL20.pdf\">Lecture 20<\/a><\/td><td class=\"column-3\"><\/td>\n<\/tr>\n<tr class=\"row-22\">\n\t<td class=\"column-1\">12.1<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2016\/01\/CO2015-16-VL21.pdf\">Lecture 21<\/a><\/td><td class=\"column-3\"><\/td>\n<\/tr>\n<tr class=\"row-23\">\n\t<td class=\"column-1\">14.1<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2016\/01\/CO2015-16-VL22.pdf\">Lecture 22<\/a><\/td><td class=\"column-3\"><b>Chapter VII: Packings and colorings in graphs<\/b><br \/>\n&sect;1 Basic definitions<br \/>\n&sect;2 Semidefinite relexation for $\\alpha$ and $\\chi$<\/td>\n<\/tr>\n<tr class=\"row-24\">\n\t<td class=\"column-1\">19.1<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2016\/01\/CO2015-16-VL23.pdf\">Lecture 23<\/a><\/td><td class=\"column-3\">&sect;3 Perfect Graphs<br \/>\n<\/td>\n<\/tr>\n<tr class=\"row-25\">\n\t<td class=\"column-1\">21.1<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2016\/01\/CO2015-16-VL24.pdf\">Lecture 24<\/a><\/td><td class=\"column-3\"><\/td>\n<\/tr>\n<tr class=\"row-26\">\n\t<td class=\"column-1\">26.1<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2016\/01\/CO2015-16-VL25.pdf\">Lecture 25<\/a><\/td><td class=\"column-3\">&sect;4 Shannon capacity<\/td>\n<\/tr>\n<tr class=\"row-27\">\n\t<td class=\"column-1\">28.1<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2016\/01\/CO2015-16-VL26.pdf\">Lecture 26<\/a><\/td><td class=\"column-3\"><\/td>\n<\/tr>\n<tr class=\"row-28\">\n\t<td class=\"column-1\">2.2<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2016\/02\/CO2015-16-VL27.pdf\">Lecture 27<\/a><\/td><td class=\"column-3\"><b>Chapter VIII: Copositive Programming<\/b><br \/>\n&sect;1 The completely positive and the copositive cone<\/td>\n<\/tr>\n<tr class=\"row-29\">\n\t<td class=\"column-1\">4.2<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2016\/02\/CO2015-16-VL28.pdf\">Lecture 28<\/a><\/td><td class=\"column-3\">&sect;2 A copositive reformulation of the independence number of a graph<\/td>\n<\/tr>\n<tr class=\"row-30\">\n\t<td class=\"column-1\">9.2<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2016\/02\/CO2015-16-VL29.pdf\">Lecture 29<\/a><\/td><td class=\"column-3\"><b>Chapter IX: Polynomial Optimization<\/b><br \/>\n&sect;1 Nonnegative polynomials and sum of squares<\/td>\n<\/tr>\n<tr class=\"row-31\">\n\t<td class=\"column-1\">11.2 (f\u00e4llt aus)<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2016\/02\/CO2015-16-VL30.pdf\">Lecture 30<\/a><\/td><td class=\"column-3\">&sect;2 Global optimization with polynomials<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<!-- #tablepress-11 from cache --><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Hand-written lecture notes:<\/p>\n","protected":false},"author":7,"featured_media":0,"parent":1953,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"sidebar-page.php","meta":{"footnotes":""},"class_list":["post-2048","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages\/2048","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/users\/7"}],"replies":[{"embeddable":true,"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/comments?post=2048"}],"version-history":[{"count":5,"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages\/2048\/revisions"}],"predecessor-version":[{"id":2212,"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages\/2048\/revisions\/2212"}],"up":[{"embeddable":true,"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages\/1953"}],"wp:attachment":[{"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/media?parent=2048"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}