Polynomial Optimisation

by Cambridge University

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/

More
Recent Episodes
  • A conic approach to entangled-assisted graph parameters
    Jul 22, 2013 – 31:43
  • A new convex reformulation and approximation hierarchy for polynomial optimisation
    Jul 22, 2013 – 30:00
  • A semidefinite programming hierarchy for geometric packing problems
    Jul 22, 2013 – 27:48
  • Algebraic and Geometric Ideas in Discrete Optimisation I
    Jul 17, 2013 – 46:02
  • Algebraic and Geometric Ideas in Discrete Optimisation II
    Jul 17, 2013 – 42:33
  • Algebraic and Geometric Ideas in Discrete Optimisation III
    Jul 17, 2013 – 01:00:00
  • Applications of linear and nonlinear optimisation in the electricity sector
    Aug 12, 2013 – 36:12
  • Computing lower bounds for a polynomial using geometric programming
    Jul 22, 2013 – 32:02
  • Concrete conditions for realizability of moment functions via quadratic modules
    Jul 22, 2013 – 30:25
  • Convex Algebraic Geometry I
    Jul 17, 2013 – 46:52
  • Convex Algebraic Geometry II
    Jul 17, 2013 – 43:54
  • Convex Algebraic Geometry III
    Jul 17, 2013 – 01:09:00
  • Convex Programming in Data Science I
    Jul 17, 2013 – 01:17:00
  • Convex Programming in Data Science II
    Jul 17, 2013 – 11:25
  • Convex Programming in Data Science III
    Jul 17, 2013 – 01:09:00
  • Current space optimisation challenges
    Aug 12, 2013 – 30:02
  • Cutting Planes for First-Level RLT Relaxations of Mixed 0-1 Programs
    Jul 22, 2013 – 23:15
  • Designing and tuning RF filters to a prescribed specification
    Aug 12, 2013 – 29:34
  • Eigenvalue optimization in connection with vertex separators (and bandwidth)
    Aug 5, 2013 – 57:52
  • Engineering Hilbert's Nullstellensatz for Combinatorial Problems
    Aug 5, 2013 – 01:11:00
  • Gap Inequalities for the Max-Cut Problem
    Jul 22, 2013 – 19:51
  • Global polynomial optimization with Moment Matrices and Border Basis
    Jul 22, 2013 – 25:36
  • Hermitian complexity of real ideals
    Jul 29, 2013 – 01:03:00
  • Hyperbolic polynomials, interlacers and sums of squares
    Jul 22, 2013 – 28:54
  • Integer quadratic minimization over polyhedra in dimension two
    Jul 22, 2013 – 33:10
  • Lift-and-project methods and relaxations for Knapsack
    Jul 31, 2013 – 01:42:00
  • Likelihood Maximization on Phylogenic Trees
    Jul 22, 2013 – 34:03
  • Linear Matrix Inequalities meet Positivstellensätze
    Jul 22, 2013 – 31:29
  • Moments and SDP for multiobjective linear programming
    Aug 5, 2013 – 41:18
  • Nonlinear Semidefinite Optimization I
    Jul 18, 2013 – 01:03:00
  • Nonlinear Semidefinite Optimization II
    Jul 18, 2013 – 59:58
  • Numerical issues in semidefinite and convex conic optimization
    Aug 7, 2013 – 48:09
  • Optimising polynomials over the simplex
    Jul 24, 2013 – 31:05
  • Optimization over Polynomials for Analysis of Polynomial Vector Fields
    Jul 22, 2013 – 34:36
  • Panel Discussion - Polynomial Optimisation Open For Business Event
    Aug 12, 2013 – 45:46
  • Polynomial optimisation in power systems at IBM Research
    Aug 12, 2013 – 32:18
  • Polynomial Optimization and Symbolic Computation: From Theory to Practice and Vice Versa
    Aug 9, 2013 – 01:18:00
  • Positive Semidefinite Rank of Polytopes
    Jul 23, 2013 – 21:26
  • Recent progress on questions of Nemirovsky and Sturmfels
    Aug 12, 2013 – 01:21:00
  • Revisiting several problems and algorithms in Continuous Location with l_p norms
    Jul 22, 2013 – 25:22
  • Scaling relationship between the copositive cone and a hierarchy of semidefinite approximations
    Jul 22, 2013 – 27:27
  • Semidefinite Programming and its Feasible Sets I
    Jul 17, 2013 – 50:55
  • Semidefinite Programming and its Feasible Sets II
    Jul 17, 2013 – 42:31
  • Semidefinite Programming and its Feasible Sets III
    Jul 17, 2013 – 01:00:00
  • Semidefinite programming at NAG
    Aug 12, 2013 – 29:42
  • Solving conic optimization problems with MOSEK
    Aug 12, 2013 – 35:12
  • Spherical Euclidean Distance Embedding and the Unit-Distance Respresentation of a Graph on a Hypersphere
    Aug 12, 2013 – 54:43
  • The A-Truncated K-Moment Problem
    Jul 22, 2013 – 37:54
  • The Geometry of Phase Transitions in Convex Optimization
    Jul 23, 2013 – 30:42
  • The graph partitioning problem: quick and dirty vs strong and long.
    Jul 31, 2013 – 01:04:00
Recent Reviews
Similar Podcasts
Disclaimer: The podcast and artwork on this page are property of the podcast owner, and not endorsed by UP.audio.