Loading Events

Past Events

Events Search and Views Navigation

Event Views Navigation

July 2019

Seminar: Chordal Completions – Semidefinite Programming and Minimum Completions

July 2 @ 2:00 pm - 3:00 pm

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 completion of a given undirected graph G is a chordal graph, on the same vertex set, that has G as a subgraph. Several classical applications…

Find out more »

June 2019

Seminar: Extremal Cuts and Isoperimetry in Random Cubic Graphs

June 28 @ 2:00 pm - 3:00 pm

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 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…

Find out more »

May 2019

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

May 2 @ 3:00 pm - 4:00 pm

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 look at globalized robust optimization that has been proposed as a generalization of the standard robust optimization framework in order to allow for a controlled decrease…

Find out more »

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

May 2 @ 1:30 pm - 2:30 pm

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 optimization. In this talk, we present a sample of our approaches and focus on provable results for both the exact and the heuristic methods. The…

Find out more »

April 2019

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

April 25 @ 11:00 am - 12:00 pm

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 maximize profits. For chemical processes, plant dynamics and control become highly relevant at these shortened time intervals, and careful attention is required to ensure computed…

Find out more »

February 2019

Seminar: Generalized maximum entropy estimation

February 26 @ 2:00 pm - 3:00 pm

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, we present a novel approximation scheme using a smoothed fast gradient method that is equipped with explicit bounds on the approximation error. This is joint…

Find out more »

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

February 6 @ 4:00 pm - 5:00 pm

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 the parametric joint-confidence regions, which are obtained in an a posteriori analysis of the parameter estimates. The optimal design is achieved by using the available…

Find out more »

November 2018

Seminar: Capacity upper bounds for deletion-type channels

November 28, 2018 @ 4:00 pm - 5:00 pm

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 i.i.d. insertions and deletions. Other than the classical deletion channel, we give a special attention to the Poisson-repeat channel introduced by Mitzenmacher and Drinea (IEEE…

Find out more »

Seminar: Arrangements of Circles and Spheres leading to Convex Hulls with Minimal Boundaries

November 16, 2018 @ 3:00 pm - 4:00 pm

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) with given radii should be arranged in such a way that a) they do not overlap and b) the length of the perimeter or surface…

Find out more »

October 2018

Seminar: Random projections in mathematical programming

October 3, 2018 @ 3:00 pm - 4:00 pm

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 form of approximation guarantee is usually preferable. In this talk we shall discuss a set of approximating reformulations to various classes of mathematical programming problems…

Find out more »
+ Export Events