Wednesday, July 21

MS40
SDP Approaches to Combinatorial and Global Optimization - Part II of III

9:45 AM - 11:45 AM

For Part I, see MS13

For Part III, see MS71

This minisymposium addresses recent results on approximating and/or solving various combinatorial optimization problems by using convex optimization. In particular, talks here present recent developments on modeling, reduction techniques, and algorithmic approaches for efficiently solving optimization problems by using semidefinite programming.

Organizer: Renata Sotirov
Tilburg University, The Netherlands
Angelika Wiegele
Universitat Klagenfurt, Austria

9:45-10:10 Hard Combinatorial Problems, Doubly Nonnegative Relaxations, Facial Reduction, and Alternating Direction Method of Multipliers abstract

Henry Wolkowicz and Hao Hu, University of Waterloo, Canada; Xinxin Li, Jilin University, China; Ting Kei Pong, Hong Kong Polytechnic University, Hong Kong; Jiyoung Im, University of Waterloo, Canada

10:15-10:40 Discrete Semidefinite Programming Techniques for the Quadratic Traveling Salesman Problem abstract

Frank de Meijer, Tilburg University, The Netherlands; Renata Sotirov, Universitat Klagenfurt, Austria

10:45-11:10 On the Finite Convergence of Sum-of-Squares Hierarchies for the Maximum Stable Set Problem abstract

Luis Felipe Vargas, CWI, Amsterdam, Netherlands

11:15-11:40 More Efficient and Flexible Flag-SOS Hierarchies coming from Polynomial Optimization abstract

Daniel Brosch, Tilburg University, The Netherlands