|
|
- Friday, 9 a.m. (block 1, HS B)
Chair: Laura Palagi
* Krislock, Nathan: Semidefinite Facial Reduction for Euclidean Distance Matrix Completion
* Lisser, Abdel: Semidefinite Programming for Stochastic Wireless OFDMA Networks
* Bonato, Thorsten: Separation for the Max-Cut Problem Using Target Cuts and Graph Contraction
* Piccialli, Veronica: SpeeDP: a fast method for solving the SDP relaxation of Max Cut
- Friday, 2 p.m. (block 2, HS B)
Chair: Franz Rendl
* Amaral, Paula: From infeasibility to copositivity
* Bomze, Immanuel: Dimensional reduction, maximum variance unfolding, and complete positivity
* Klep, Igor: Relaxing LMI domination matricially
* Povh, Janez: Semidefinite programming certificates for matrix inequalities
- Saturday, 9 a.m. (block 3, HS B)
Chair: Gerhard Reinelt
* Davi, Thomas: A primal-dual method for solving large-scale conic programs
* Elloumi, Sourour: Quadratic convex reformulation for integer quadratic programming: QCR and extension
* Hungerländer, Philipp: Two nonstandard active set methods for convex problems with simple bounds
* Liers, Frauke: Exact IP-based Approaches for Solving Constrained Quadratic 0--1 Optimization Problems
|
|
