skip to content
 

Seminars (POPW01)

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

Search seminar archive

Event When Speaker Title Presentation Material
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 Higher-Order Semidefinite Relaxations for Max-Cut
POPW01 17th July 2013
15:00 to 15:30
MA Marshall Computing lower bounds for a polynomial using geometric programming
POPW01 17th July 2013
16:00 to 16:30
PJC Dickinson A new convex reformulation and approximation hierarchy for polynomial optimisation
POPW01 17th July 2013
16:30 to 17:00
L Galli Gap Inequalities for the Max-Cut Problem
POPW01 18th July 2013
09:30 to 10:00
I Klep Linear Matrix Inequalities meet Positivstellensätze
POPW01 18th July 2013
10:00 to 10:30
D de Laat A semidefinite programming hierarchy for geometric packing problems
POPW01 18th July 2013
10:30 to 11:00
M Abril-Bucero Global polynomial optimization with Moment Matrices and Border Basis
POPW01 18th July 2013
11:30 to 12:00
L Gijben Scaling relationship between the copositive cone and a hierarchy of semidefinite approximations
POPW01 18th July 2013
12:00 to 12:30
A Ahmadi Optimization over Polynomials for Analysis of Polynomial Vector Fields
POPW01 18th July 2013
14:00 to 14:30
K Kaparis Cutting Planes for First-Level RLT Relaxations of Mixed 0-1 Programs
POPW01 18th July 2013
14:30 to 15:00
J Nie The A-Truncated K-Moment Problem
POPW01 18th July 2013
15:00 to 15:30
M Infusino Concrete conditions for realizability of moment functions via quadratic modules
POPW01 19th July 2013
09:30 to 10:00
D Plaumann Hyperbolic polynomials, interlacers and sums of squares
POPW01 19th July 2013
10:00 to 10:30
R Hauser Likelihood Maximization on Phylogenic Trees
POPW01 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
POPW01 19th July 2013
11:30 to 12:00
T Piovesan A conic approach to entangled-assisted graph parameters
POPW01 19th July 2013
12:00 to 12:30
R Weismantel Integer quadratic minimization over polyhedra in dimension two
POPW01 19th July 2013
14:00 to 14:30
B Matschke The width of 5-dimensional 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
RZ Robinson Positive Semidefinite Rank of Polytopes
POPW01 19th July 2013
16:00 to 16:30
I Bomze Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
POPW01 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 London Mathematical Society NM Rothschild and Sons