POPW01 
15th July 2013 09:30 to 10:15 
T Netzer 
Semidefinite Programming and its Feasible Sets I 

POPW01 
15th July 2013 10:15 to 11:00 
T Netzer 
Semidefinite Programming and its Feasible Sets II 

POPW01 
15th July 2013 11:30 to 12:30 
T Netzer 
Semidefinite Programming and its Feasible Sets III 

POPW01 
15th July 2013 14:00 to 14:45 
J De Loera 
Algebraic and Geometric Ideas in Discrete Optimisation I 

POPW01 
15th July 2013 14:45 to 15:30 
J De Loera 
Algebraic and Geometric Ideas in Discrete Optimisation II 

POPW01 
15th July 2013 16:00 to 17:00 
J De Loera 
Algebraic and Geometric Ideas in Discrete Optimisation III 

POPW01 
16th July 2013 09:30 to 10:15 
E Candes 
Convex Programming in Data Science I 

POPW01 
16th July 2013 10:15 to 11:00 
E Candes 
Convex Programming in Data Science II 

POPW01 
16th July 2013 11:30 to 12:30 
E Candes 
Convex Programming in Data Science III 

POPW01 
16th July 2013 14:00 to 14:45 
B Sturmfels 
Convex Algebraic Geometry I 

POPW01 
16th July 2013 14:45 to 15:30 
B Sturmfels 
Convex Algebraic Geometry II 

POPW01 
16th July 2013 16:00 to 17:00 
B Sturmfels 
Convex Algebraic Geometry III 

POPW01 
17th July 2013 09:30 to 10:30 
M Kocvara 
Nonlinear Semidefinite Optimization I 

POPW01 
17th July 2013 11:00 to 12:00 
M Kocvara 
Nonlinear Semidefinite Optimization II 

POPW01 
17th July 2013 14:30 to 15:00 
MF Anjos 
Towards Efficient HigherOrder Semidefinite Relaxations for MaxCut 

POPW01 
17th July 2013 15:00 to 15:30 

Computing lower bounds for a polynomial using geometric programming 

POPW01 
17th July 2013 16:00 to 16:30 

A new convex reformulation and approximation hierarchy for polynomial optimisation 

POPW01 
17th July 2013 16:30 to 17:00 

Gap Inequalities for the MaxCut Problem 

POPW01 
18th July 2013 09:30 to 10:00 

Linear Matrix Inequalities meet Positivstellensätze 

POPW01 
18th July 2013 10:00 to 10:30 

A semidefinite programming hierarchy for geometric packing problems 

POPW01 
18th July 2013 10:30 to 11:00 

Global polynomial optimization with Moment Matrices and Border Basis 

POPW01 
18th July 2013 11:30 to 12:00 

Scaling relationship between the copositive cone and a hierarchy of semidefinite approximations 

POPW01 
18th July 2013 12:00 to 12:30 

Optimization over Polynomials for Analysis of Polynomial Vector Fields 

POPW01 
18th July 2013 14:00 to 14:30 

Cutting Planes for FirstLevel RLT Relaxations of Mixed 01 Programs 

POPW01 
18th July 2013 14:30 to 15:00 

The ATruncated KMoment Problem 

POPW01 
18th July 2013 15:00 to 15:30 

Concrete conditions for realizability of moment functions via quadratic modules 

POPW01 
19th July 2013 09:30 to 10:00 

Hyperbolic polynomials, interlacers and sums of squares 

POPW01 
19th July 2013 10:00 to 10:30 

Likelihood Maximization on Phylogenic Trees 

POPW01 
19th July 2013 10:30 to 11:00 

Revisiting several problems and algorithms in Continuous Location with l_p norms 

POPW01 
19th July 2013 11:30 to 12:00 
T Piovesan 
A conic approach to entangledassisted graph parameters 

POPW01 
19th July 2013 12:00 to 12:30 

Integer quadratic minimization over polyhedra in dimension two 

POPW01 
19th July 2013 14:00 to 14:30 

The width of 5dimensional prismatoids 

POPW01 
19th July 2013 14:30 to 15:00 
M Lotz 
The Geometry of Phase Transitions in Convex Optimization 

POPW01 
19th July 2013 15:00 to 15:30 

Positive Semidefinite Rank of Polytopes 

POPW01 
19th July 2013 16:00 to 16:30 
I Bomze 
Narrowing the difficulty gap for the CelisDennisTapia problem 

POPW01 
19th July 2013 16:30 to 17:00 

Optimising polynomials over the simplex 

POP 
22nd July 2013 10:00 to 11:00 
I Bomze 
A nasty cone with nice properties  recent advances in copositive optimisation. 

POP 
23rd July 2013 10:00 to 11:00 

Recent progress on questions of Nemirovsky and Sturmfels 

POP 
24th July 2013 10:00 to 11:00 

Local and global optimality conditions for multivariate polynomial optimization. 

POP 
25th July 2013 10:00 to 11:00 
M Putinar 
Hermitian complexity of real ideals 

POP 
25th July 2013 15:00 to 16:00 

Moments of measures on compact polyhedra, weighted triangulations, integral transforms, and multisymmetric polynomials. 

POP 
26th July 2013 10:00 to 11:00 

From approximate cone factorizations to approximate lifts of polytopes 

POP 
29th July 2013 10:00 to 11:00 

The graph partitioning problem: quick and dirty vs strong and long 

POP 
30th July 2013 10:00 to 11:00 

Liftandproject methods and relaxations for Knapsack 

POP 
30th July 2013 15:00 to 16:00 
D Steurer 
The unique games conjecture and polynomial optimization 

POP 
31st July 2013 10:00 to 11:00 
P Dickinson 
On the setcopositive cone. 

POP 
1st August 2013 11:00 to 12:00 

Eigenvalue optimization in connection with vertex separators (and bandwidth) 

POP 
1st August 2013 15:00 to 16:00 

Moments and SDP for multiobjective linear programming 

POP 
2nd August 2013 10:00 to 11:00 

Semidefinite relaxations for various nonconvex quadratic optimization problems. 

POP 
2nd August 2013 15:00 to 16:00 
D Steurer 
Multiplicative Update Methods and Semidefinite Programming 

POP 
5th August 2013 10:00 to 11:00 

Engineering Hilbert's Nullstellensatz for Combinatorial Problems 

POP 
6th August 2013 14:00 to 15:00 

Numerical issues in semidefinite and convex conic optimization 

POP 
7th August 2013 10:00 to 11:00 

Polynomial Optimization and Symbolic Computation: From Theory to Practice and Vice Versa 

OFB015 
8th August 2013 14:15 to 14:45 
M Anjos 
Applications of linear and nonlinear optimisation in the electricity sector 

OFB015 
8th August 2013 14:45 to 15:15 

Current space optimisation challenges 

OFB015 
8th August 2013 15:15 to 15:45 

Designing and tuning RF filters to a prescribed specification 

OFB015 
8th August 2013 15:45 to 16:15 

Polynomial optimisation in power systems at IBM Research 

OFB015 
8th August 2013 16:45 to 17:15 

Semidefinite programming at NAG 

OFB015 
8th August 2013 17:15 to 17:45 
E Andersen 
Solving conic optimization problems with MOSEK 

OFB015 
8th August 2013 17:45 to 18:30 

Panel Discussion 

POP 
9th August 2013 10:00 to 11:00 

Spherical Euclidean Distance Embedding and the UnitDistance Respresentation of a Graph on a Hypersphere 
