Title: More Virtuous Smoothing and Embracing the Ghost of Rolle Speaker: Prof Jon Lee Affiliation: Industrial and Operations Engineering, College of Engineering, University of Michigan Location: LT 308 Huxley Building Time: 14:00 - 15:00 Abstract. In the context of global optimization of mixed-integer nonlinear optimization formulations, we consider smoothing univariate concave increasing functions that have poorly... Read more »

Title: Random projections in mathematical programming Speaker: Dr Leo Liberti Affiliation: CNRS LIX, École Polytechnique Location: 218 Huxley Building Time: 15:00 - 16:00 Abstract. In the algorithmic trade-off between generality and efficiency, sometimes the only way out is to accept approximate methods. If all else fails, we can always fall back on heuristic methods. But some... Read more »

Title: Arrangements of Circles and Spheres leading to Convex Hulls with Minimal Boundaries Speaker: Dr Josef Kallrath Affiliation: Advanced Business Analytics, BASF SE, Germany Location: 218 Huxley Building Time: 15:00 - 16:00 Abstract. We present and solve a new computational geometry optimization problem in 2D and 3D and provide theoretical insights. Circles (2D) and Spheres (3D)... Read more »

Title: Capacity upper bounds for deletion-type channels Speaker: Dr Mahdi Cheraghchi Affiliation: Dept of Computing, Imperial College London Location: 218 Huxley Building Time: 16:00 - 17:00 Abstract. We develop a systematic approach, based on convex programming and real analysis, for obtaining upper bounds on the capacity of the binary deletion channel and, more generally, channels with... Read more »

Title: Model-based design of optimal experiments using exact confidence regions Speaker: Dr Radoslav Paulen Affiliation: Institute of Information Engineering, Automation and Mathematics, Slovak University of Technology Location: 218 Huxley Building Time: 16:00 - 17:00 Abstract. This talk discusses a model-based optimal experiment design (OED) for nonlinear systems. OED represents a methodology for optimizing the geometry of... Read more »

Title: Generalized maximum entropy estimation Speaker: Dr David Sutter Affiliation: Institute for Theoretical Physics, ETH Zurich Location: 217 Huxley Building Time: 14:00 - 15:00 Abstract. We consider the problem of estimating a probability distribution that maximizes the entropy while satisfying a finite number of moment constraints, possibly corrupted by noise. Based on duality of convex programming,... Read more »

Title: Data-Driven Methods for Integrated Production Scheduling and Process Control Speaker: Calvin Tsay Affiliation: McKetta Dept of Chemical Engineering, University of Texas at Austin Location: 218 Huxley Building Time: 11:00 - 12:00 Abstract. Due to the fast-changing market conditions enabled by globalization and modern infrastructures, industrial production scheduling is often performed over relatively short time intervals to... Read more »

Title: Exact and heuristic MIP methods for the solution of MINLP - Examples from gas transport optimization problems Speaker: Dr Lars Schewe Affiliation: Dept of Mathematics, FAU Erlangen-Nürnberg Location: 217 Huxley Building Time: 13:30 - 14:30 Abstract. In this talk, we present exact and heuristic methods for MINLP, the development of which was motivated by applications in gas transport... Read more »

Title: Robust Discrete Optimization: Globalized Gamma Robustness and Radius of Robust Feasibility Speaker: Prof. Dr Frauke Liers Affiliation: Dept of Mathematics, FAU Erlangen-Nürnberg Location: 217 Huxley Building Time: 15:00 - 16:00 Abstract. In this talk, we extend the notion of two robust optimization methodologies that were originally introduced for continuous problems towards robust discrete tasks. On the one hand, we... Read more »

Title: Extremal Cuts and Isoperimetry in Random Cubic Graphs Speaker: Prof. Gregory B. Sorkin Affiliation: Dept of Mathematics, The London School of Economics and Political Science (LSE) Location: LT139 Huxley Building Time: 14:00 - 15:00 Abstract. The minimum bisection width of random cubic graphs is of interest because it is one of the simplest questions imaginable... Read more »