Polynomial optimisation: workshop and summer school

Workshop theme

Optimisation problems that involve polynomials are currently receiving a great deal of attention, due to their generality, their challenging nature and their wide range of practical applications. These two events provide an opportunity for researchers to learn more about this new, exciting and growing field.

The Summer School will begin in the morning of Monday 15 July and finish at lunchtime on Wednesday 17 July. It will consist of a series of tutorials from five internationally respected invited speakers on the following themes:

Some Recent Uses of Convex Programming in Data Science
Emmanuel Candès (Stanford University)
Nonlinear Semidefinite Optimization
Michal Kocvara (University of Birmingham)
Algebraic and Geometric Ideas in the Theory of Discrete Optimisation
Jesús De Loera (University of California, Davis)
Semidefinite Programming and its Feasible Sets
Tim Netzer (Leipzig University)
Convex Algebraic Geometry
Bernd Sturmfels (University of California, Berkeley)

The Workshop will begin at lunchtime on Wednesday 17 July and finish in the afternoon on Friday 19 July. It will consist of a series of contributed talks, and a poster session for PhD students and post-docs.

People who wish to speak or present a poster are invited to submit a short abstract. Abstracts and posters on all aspects of polynomial optimisation (e.g. theory, applications, algorithms and software) will be welcomed. The abstracts will undergo a light and informal refereeing process, purely to ensure that they are within the scope of the workshop.

The application is closed

Timetable

Monday 15th July 2013
08:45 to 09:15	Registration	No Room Required
09:15 to 09:30	Summer School: Welcome from Adam Letchfor (Organiser) & John Toland (INI Director)	Room 1
09:30 to 10:15	Tim Netzer Universität Leipzig Semidefinite Programming and its Feasible Sets I	Room 1
10:15 to 11:00	Tim Netzer Universität Leipzig Semidefinite Programming and its Feasible Sets II	Room 1
11:00 to 11:30	Morning Coffee	No Room Required
11:30 to 12:30	Tim Netzer Universität Leipzig Semidefinite Programming and its Feasible Sets III	Room 1
12:30 to 13:30	Lunch at Wolfson Court	No Room Required
14:00 to 14:45	Jesus De Loera University of California, Davis Algebraic and Geometric Ideas in Discrete Optimisation I	Room 1
14:45 to 15:30	Jesus De Loera University of California, Davis Algebraic and Geometric Ideas in Discrete Optimisation II	Room 1
15:30 to 16:00	Afternoon Tea	No Room Required
16:00 to 17:00	Jesus De Loera University of California, Davis Algebraic and Geometric Ideas in Discrete Optimisation III	Room 1
17:00 to 18:00	Welcome wine reception	No Room Required

Tuesday 16th July 2013
09:30 to 10:15	Emmanuel Candes Stanford University Convex Programming in Data Science I	Room 1
10:15 to 11:00	Emmanuel Candes Stanford University Convex Programming in Data Science II	Room 1
11:00 to 11:30	Morning Coffee	No Room Required
11:30 to 12:30	Emmanuel Candes Stanford University Convex Programming in Data Science III	Room 1
12:30 to 13:30	Lunch at Wolfson Court	No Room Required
14:00 to 14:45	Bernd Sturmfels University of California, Berkeley Convex Algebraic Geometry I	Room 1
14:45 to 15:30	Bernd Sturmfels University of California, Berkeley Convex Algebraic Geometry II	Room 1
15:30 to 16:00	Afternoon Tea	No Room Required
16:00 to 17:00	Bernd Sturmfels University of California, Berkeley Convex Algebraic Geometry III	Room 1

Wednesday 17th July 2013
09:30 to 10:30	Michal Kocvara University of Birmingham Nonlinear Semidefinite Optimization I	Room 1
10:30 to 11:00	Morning Coffee	No Room Required
11:00 to 12:00	Michal Kocvara University of Birmingham Nonlinear Semidefinite Optimization II	Room 1
12:00 to 12:00	End of Summer School/Start of Workshop	No Room Required
12:30 to 13:30	Lunch at Wolfson Court	No Room Required
14:00 to 14:30	Workshop: Welcome and introduction	Room 1
14:30 to 15:00	Miguel Anjos École Polytechnique de Montréal Towards Efficient Higher-Order Semidefinite Relaxations for Max-Cut	Room 1
15:00 to 15:30	Murray Marshall University of Saskatchewan Computing lower bounds for a polynomial using geometric programming	Room 1
15:30 to 16:00	Afternoon Tea	No Room Required
16:00 to 16:30	Peter Dickinson Technische Universität Wien A new convex reformulation and approximation hierarchy for polynomial optimisation	Room 1
16:30 to 17:00	Laura Galli Università di Pisa Gap Inequalities for the Max-Cut Problem	Room 1
19:30 to 22:00	Conference Dinner at Emmanuel College	No Room Required

Thursday 18th July 2013
09:30 to 10:00	Igor Klep University of Auckland Linear Matrix Inequalities meet Positivstellensätze	Room 1
10:00 to 10:30	David de Laat Technische Universiteit Delft A semidefinite programming hierarchy for geometric packing problems	Room 1
10:30 to 11:00	Marta Abril-Bucero INRIA Sophia Antipolis Global polynomial optimization with Moment Matrices and Border Basis	Room 1
11:00 to 11:30	Morning Coffee	No Room Required
11:30 to 12:00	Luuk Gijben Rijksuniversiteit Groningen Scaling relationship between the copositive cone and a hierarchy of semidefinite approximations	Room 1
12:00 to 12:30	Amirali Ahmadi IBM Thomas J. Watson Research Center New York Optimization over Polynomials for Analysis of Polynomial Vector Fields	Room 1
12:30 to 13:30	Lunch at Wolfson Court	No Room Required
14:00 to 14:30	Konstantinos Kaparis Lancaster University Cutting Planes for First-Level RLT Relaxations of Mixed 0-1 Programs	Room 1
14:30 to 15:00	Jiawang Nie University of California, San Diego The A-Truncated K-Moment Problem	Room 1
15:00 to 15:30	Maria Infusino University of Reading Concrete conditions for realizability of moment functions via quadratic modules	Room 1
15:30 to 17:00	Afternoon Tea and Poster Session	No Room Required

Friday 19th July 2013
09:30 to 10:00	Daniel Plaumann Universität Konstanz Hyperbolic polynomials, interlacers and sums of squares	Room 1
10:00 to 10:30	Raphael Hauser University of Oxford Likelihood Maximization on Phylogenic Trees	Room 1
10:30 to 11:00	Safae El Haj Ben Ali Universidad de Sevilla Revisiting several problems and algorithms in Continuous Location with l_p norms	Room 1
11:00 to 11:30	Morning Coffee	No Room Required
11:30 to 12:00	Teresa Piovesan Centrum voor Wiskunde en Informatica (CWI) A conic approach to entangled-assisted graph parameters	Room 1
12:00 to 12:30	Robert Weismantel ETH Zürich Integer quadratic minimization over polyhedra in dimension two	Room 1
12:30 to 13:30	Lunch at Wolfson Court	No Room Required
14:00 to 14:30	Benjamin Matschke ETH Zürich The width of 5-dimensional prismatoids	Room 1
14:30 to 15:00	Martin Lotz University of Manchester The Geometry of Phase Transitions in Convex Optimization	Room 1
15:00 to 15:30	Richard Robinson University of Washington Positive Semidefinite Rank of Polytopes	Room 1
15:30 to 16:00	Afternoon Tea	No Room Required
16:00 to 16:30	Immanuel Bomze Technische Universität Wien Narrowing the difficulty gap for the Celis-Dennis-Tapia problem	Room 1
16:30 to 17:00	Etienne de Klerk Nanyang Technological University Optimising polynomials over the simplex	Room 1
17:00 to 17:00	End of Workshop	Room 1

Polynomial optimisation: workshop and summer school

Speakers

Marta Abril-Bucero INRIA Sophia Antipolis
Amirali Ahmadi IBM Thomas J. Watson Research Center New York
Miguel Anjos École Polytechnique de Montréal
Immanuel Bomze Technische Universität Wien
Emmanuel Candes Stanford University
Etienne de Klerk Nanyang Technological University
David de Laat Technische Universiteit Delft
Jesus De Loera University of California, Davis
Peter Dickinson Technische Universität Wien
Safae El Haj Ben Ali Universidad de Sevilla
Laura Galli Università di Pisa
Luuk Gijben Rijksuniversiteit Groningen
Raphael Hauser University of Oxford
Maria Infusino University of Reading
Konstantinos Kaparis Lancaster University
Igor Klep University of Auckland
Michal Kocvara University of Birmingham
Martin Lotz University of Manchester
Murray Marshall University of Saskatchewan
Benjamin Matschke ETH Zürich
Tim Netzer Universität Leipzig
Jiawang Nie University of California, San Diego
Teresa Piovesan Centrum voor Wiskunde en Informatica (CWI)
Daniel Plaumann Universität Konstanz
Richard Robinson University of Washington
Bernd Sturmfels University of California, Berkeley
Robert Weismantel ETH Zürich

Show All

Polynomial optimisation: workshop and summer school

Workshop theme

The application is closed

Timetable

Speakers

Supported By

Register for updates