![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Mixed Integer Convex Optimization
Mixed Integer Convex OptimizationAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Mustapha Amrani. Polynomial Optimisation This talk deals with algorithms and complexity results about the minimization of convex functions over integer points in convex regions. This topic is quite novel and today only few non-trivial algorithmic methods exist that can cope with problems of this generality. We survey current state of art, both when the number of integer variables is constant and variable. We discuss results about the speed of convergence of oracle algorithms that iteratively solve special integer subproblems with a constant approximation factor. Despite the generality of the underlying setting we show how to detect efficiently w.r.t. our oracle assumptions feasible solutions whose objective function value is close to the optimal value. We also show how to prove that such proximity results are best possible up to a polynomial factor. This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsELCF - Engineering for a Low Carbon Future (seminar series) Cambridge Mathematics Placements (CMP) Seminars Graduate Women's NetworkOther talksAnthropology, mass graves and the politics of the dead Polynomial approximation of high-dimensional functions on irregular domains Tracking neurobiological factors of language developmental difficulties Coordination and inequalities in agglomeration payments: evidence from a laboratory experiment Future directions panel Prof Chris Rapley (UCL): Polar Climates |