5th SDP Day

Workshop Day on Applications of Semidefinite Optimization

June 30, 2016


From 10:00 Coffee
10:30 - 11:15 Lecture by Etienne de Klerk, Tilburg University
On the worst-case complexity of the gradient method with exact line search for strongly convex functions with Lipschitz gradients.
11:30 - 12:15 Lecture by Frank Permenter, MIT
Solving conic optimization problems via self-dual embedding and facial reduction: a unified approach. Slides.
12:30 - 14:00 Lunch (Cafe Polder)
14:00 - 15:00 Lecture by Bart Litjens and Sven Polak, University of Amsterdam
New upper bounds for nonbinary codes based on quadruples. Slides.
15:00 - 15:30 Coffee break
15:30 - 16:15 Lecture by Roy Schwartz, Technion
Partitioning Graphs into Balanced Components.
16:30 - 17:15 Lecture by Shashwat Garg,Technical University Eindhoven
Better algorithmic bound for the Komlos discrepancy problem. Slides.
17:00 - 18:00 Drinks


Participation is free, but please register by sending an email to Susanne van Dam (susanne@cwi.nl) before Tuesday 28 June (1pm) so that we can organize the catering.


CWI, room L120 (first floor in the new wing of the building)

CWI, Science Park 123, 1098 XG Amsterdam. Directions can be found here.


Nikhil Bansal, Monique Laurent, Ronald de Wolf

NWO TOP Project AQSO: Approximation Algorithms, Quantum Information and Semidefinite Optimizationi.

Lex Schrijver

ERC Advanced grant AFMIDMOA: Applying Fundamental Mathematics in Discrete Mathematics, Optimization, and Algorithmics.

Information about the 4th SDP Days

can be found here.