Polynomial Optimisation

Polynomial Optimisation

Optimisation problems involving polynomials arise in a wide variety of contexts, including operational research, statistics, probability, finance, computer science, structural engineering, statistical physics, combinatorial chemistry, computational biology and algorithmic graph theory. They are however extremely challenging to solve, both in theory and practice. Existing algorithms and software are capable of solving only very small instances to proven optimality, unless they have some amenable structure, such as sparsity or convexity. Read more at: http://www.newton.ac.uk/programmes/POP/

PLAY ON CASTBOX
Panel Discussion - Polynomial Optimisation Open For Business Event

Panel Discussion - Polynomial Optimisation Open For Business Event

Panel: Anjos, M; Ortega, G; Parry, R; Marecek, J; Fiala, J; Andersen, E Thursday 08 August 2013, 17:45-18:30

08-12
45:46
Spherical Euclidean Distance Embedding and the Unit-Distance Respresentation of a Graph on a Hypersphere

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

Qi, H (University of Southampton) Friday 09 August 2013, 10:00-11:00

08-12
54:43
Recent progress on questions of Nemirovsky and Sturmfels

Recent progress on questions of Nemirovsky and Sturmfels

Scheiderer, C (Universität Konstanz) Tuesday 23 July 2013, 10:00-11:00

08-12
01:21:28
Solving conic optimization problems with MOSEK

Solving conic optimization problems with MOSEK

Andersen, E (MOSEK) Thursday 08 August 2013, 17:15-17:45

08-12
35:12
Semidefinite programming at NAG

Semidefinite programming at NAG

Fiala, J (Numerical Algorithms Group) Thursday 08 August 2013, 16:45-17:15

08-12
29:42
Polynomial optimisation in power systems at IBM Research

Polynomial optimisation in power systems at IBM Research

Marecek, J (IBM Dublin) Thursday 08 August 2013, 15:45-16:15

08-12
32:18
Designing and tuning RF filters to a prescribed specification

Designing and tuning RF filters to a prescribed specification

Parry, R (Radio Design) Thursday 08 August 2013, 15:15-15:45

08-12
29:34
Current space optimisation challenges

Current space optimisation challenges

Ortega, G (European Space Agency) Thursday 08 August 2013, 14:45-15:15

08-12
30:02
Applications of linear and nonlinear optimisation in the electricity sector

Applications of linear and nonlinear optimisation in the electricity sector

Anjos, M (École Polytechnique de Montréal) Thursday 08 August 2013, 14:15-14:45

08-12
36:12
Polynomial Optimization and Symbolic Computation: From Theory to Practice and Vice Versa

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

Safey El Din, M (Université Pierre & Marie Curie-Paris VI) Wednesday 07 August 2013, 10:00-11:00

08-09
01:18:12
Numerical issues in semidefinite and convex conic optimization

Numerical issues in semidefinite and convex conic optimization

Jarre, F (Heinrich-Heine-Universität Düsseldorf ) Tuesday 06 August 2013, 14:00-15:00

08-07
48:09
Engineering Hilbert's Nullstellensatz for Combinatorial Problems

Engineering Hilbert's Nullstellensatz for Combinatorial Problems

Lee, J (University of Michigan) Monday 05 August 2013, 10:00-11:00

08-05
01:11:00
Moments and SDP for multiobjective linear programming

Moments and SDP for multiobjective linear programming

Puerto, J (Universidad de Sevilla) Thursday 01 August 2013, 15:00-16:00

08-05
41:18
Eigenvalue optimization in connection with vertex separators (and bandwidth)

Eigenvalue optimization in connection with vertex separators (and bandwidth)

Rendl, F (Alpen-Adria-Universität Klagenfurt) Thursday 01 August 2013, 11:00-12:00

08-05
57:52
The unique games conjecture and polynomial optimization

The unique games conjecture and polynomial optimization

Steurer, D (Cornell University) Tuesday 30 July 2013, 15:00-16:00

08-01
01:16:00
Lift-and-project methods and relaxations for Knapsack

Lift-and-project methods and relaxations for Knapsack

Chlamtac, E (Ben-Gurion University) Tuesday 30 July 2013, 10:00-11:00

07-31
01:42:00
The graph partitioning problem: quick and dirty vs strong and long.

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

Sotirov, R (Universiteit van Tilburg) Monday 29 July 2013, 10:00-11:00

07-31
01:04:00
Hermitian complexity of real ideals

Hermitian complexity of real ideals

Putinar, M (University of California, Santa Barbara) Thursday 25 July 2013, 10:00-11:00

07-29
01:03:00
Optimising polynomials over the simplex

Optimising polynomials over the simplex

De Klerk, E (Nanyang Technological University) Friday 19 July 2013, 16:30-17:00

07-24
31:05

Positive Semidefinite Rank of Polytopes

Robinson, RZ (University of Washington) Friday 19 July 2013, 15:00-15:30

07-23
21:26
View All on Castbox

Recommend Channels