skip to content
 

Seminars (POPW01)

Videos and presentation materials from other INI events are also available.

Search seminar archive

Date Time Speaker Title Presentation Material
15th July 2013 09:30 to 10:15 T Netzer Semidefinite Programming and its Feasible Sets I
15th July 2013 10:15 to 11:00 T Netzer Semidefinite Programming and its Feasible Sets II
15th July 2013 11:30 to 12:30 T Netzer Semidefinite Programming and its Feasible Sets III
15th July 2013 14:00 to 14:45 J De Loera Algebraic and Geometric Ideas in Discrete Optimisation I
15th July 2013 14:45 to 15:30 J De Loera Algebraic and Geometric Ideas in Discrete Optimisation II
15th July 2013 16:00 to 17:00 J De Loera Algebraic and Geometric Ideas in Discrete Optimisation III
16th July 2013 09:30 to 10:15 E Candes Convex Programming in Data Science I
16th July 2013 10:15 to 11:00 E Candes Convex Programming in Data Science II
16th July 2013 11:30 to 12:30 E Candes Convex Programming in Data Science III
16th July 2013 14:00 to 14:45 B Sturmfels Convex Algebraic Geometry I
16th July 2013 14:45 to 15:30 B Sturmfels Convex Algebraic Geometry II
16th July 2013 16:00 to 17:00 B Sturmfels Convex Algebraic Geometry III
17th July 2013 09:30 to 10:30 M Kocvara Nonlinear Semidefinite Optimization I
17th July 2013 11:00 to 12:00 M Kocvara Nonlinear Semidefinite Optimization II
17th July 2013 14:30 to 15:00 MF Anjos Towards Efficient Higher-Order Semidefinite Relaxations for Max-Cut
17th July 2013 15:00 to 15:30 MA Marshall Computing lower bounds for a polynomial using geometric programming
17th July 2013 16:00 to 16:30 PJC Dickinson A new convex reformulation and approximation hierarchy for polynomial optimisation
17th July 2013 16:30 to 17:00 L Galli Gap Inequalities for the Max-Cut Problem
18th July 2013 09:30 to 10:00 I Klep Linear Matrix Inequalities meet Positivstellensätze
18th July 2013 10:00 to 10:30 D de Laat A semidefinite programming hierarchy for geometric packing problems
18th July 2013 10:30 to 11:00 M Abril-Bucero Global polynomial optimization with Moment Matrices and Border Basis
18th July 2013 11:30 to 12:00 L Gijben Scaling relationship between the copositive cone and a hierarchy of semidefinite approximations
18th July 2013 12:00 to 12:30 A Ahmadi Optimization over Polynomials for Analysis of Polynomial Vector Fields
18th July 2013 14:00 to 14:30 K Kaparis Cutting Planes for First-Level RLT Relaxations of Mixed 0-1 Programs
18th July 2013 14:30 to 15:00 J Nie The A-Truncated K-Moment Problem
18th July 2013 15:00 to 15:30 M Infusino Concrete conditions for realizability of moment functions via quadratic modules
19th July 2013 09:30 to 10:00 D Plaumann Hyperbolic polynomials, interlacers and sums of squares
19th July 2013 10:00 to 10:30 R Hauser Likelihood Maximization on Phylogenic Trees
19th July 2013 10:30 to 11:00 A El Haj Ben Ali Revisiting several problems and algorithms in Continuous Location with l_p norms
19th July 2013 11:30 to 12:00 T Piovesan A conic approach to entangled-assisted graph parameters
19th July 2013 12:00 to 12:30 R Weismantel Integer quadratic minimization over polyhedra in dimension two
19th July 2013 14:00 to 14:30 B Matschke The width of 5-dimensional prismatoids
19th July 2013 14:30 to 15:00 M Lotz The Geometry of Phase Transitions in Convex Optimization
19th July 2013 15:00 to 15:30 RZ Robinson Positive Semidefinite Rank of Polytopes
19th July 2013 16:00 to 16:30 I Bomze Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
19th July 2013 16:30 to 17:00 E De Klerk Optimising polynomials over the simplex
University of Cambridge Research Councils UK
    Clay Mathematics Institute The Leverhulme Trust London Mathematical Society Microsoft Research NM Rothschild and Sons