Link to COG weekly seminars here (Google Sheets).

  • Seminar: Model-based design of optimal experiments using exact confidence regions

    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 »

  • Seminar: Generalized maximum entropy estimation

    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 »

  • Seminar: Data-Driven Methods for Integrated Production Scheduling and Process Control

    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 »

  • Seminar: Exact and heuristic MIP methods for the solution of MINLP – Examples from gas transport optimization problems

    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 »

  • Seminar: Robust Discrete Optimization: Globalized Gamma Robustness and Radius of Robust Feasibility

    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 »

  • Seminar: Extremal Cuts and Isoperimetry in Random Cubic Graphs

    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 »

  • Seminar: Chordal Completions – Semidefinite Programming and Minimum Completions

    Title: Chordal Completions - Semidefinite Programming and Minimum Completions Speaker: Dr Arvind Raghunathan Affiliation: Mitsubishi Electric Research Laboratories (MERL) Location: 217 Huxley Building Time: 14:00 - 15:00 Abstract. A graph is chordal if every cycle of length at least four contains a chord, that is, an edge connecting two nonconsecutive vertices of the cycle. Chordal... Read more »

  • Seminar: Largest Small n-Polygons: Numerical Results and Conjectured Optima

    Title: Largest Small n-Polygons: Numerical Results and Conjectured Optima Speaker: János D. Pintér Affiliation: Department of Industrial and Systems Engineering, Lehigh University Location: 218 Huxley Building Time: 14:00 - 15:00   Abstract. LSP(n), the largest small polygon with n vertices, is defined as the polygon of unit diameter that has maximal area A(n). Finding the configuration LSP(n) and the... Read more »

  • Seminar with Prof. Greg Sorkin: Extremal Cuts and Isoperimetry in Random Cubic Graphs

    Huxley 217

    The minimum bisection width of random cubic graphs is of interest because it is one of the simplest questions imaginable in extremal combinatorics, and also because the minimum bisection of (general) cubic graphs plays a role in the construction of efficient exponential-time algorithms, and it seems likely that random cubic graphs are extremal. It is... Read more »

  • Seminar by prof. Miguel Anjos

    Huxley 217

    Professor Miguel Anjos from the University of Edinburgh is giving a seminar on: Tight-and-Cheap Conic Relaxations for AC Optimal Power Flow and Optimal Reactive Power Dispatch   Abstract: The classical alternating current optimal power flow problem is nonconvex and generally hard to solve. We propose a new conic relaxation obtained by combining semidefinite optimization with... Read more »