Past Events › Colloquium

On Monday, November 20, 2017, at 16:00  Prof. John Pearson of School of Mathematics, The University of Edinburgh will join the ALOP-Colloquium and present his recent work entitledFour Perspectives on Preconditioning PDE-Constrained Optimization ProblemsAbstract:PDE-constrained optimization problems have a wide range of applications across numerical mathematics and applied science, so it is important to develop fast and feasible methods to solve such problems. We employ preconditioned iterative methods to tackle the large and sparse matrix systems that arise from their discretization,…

On Monday, December 4, 2017, at 16:00 Prof. Ekaterina Kostina of Heidelberg University will join the ALOP-Colloquium and present her recent work entitled Optimization-Based Model Validation - a Mathematical Technology of High ImpactValidated dependable mathematical models are of ever growing importance in science and engineering, and today also driven by a serious demand of the industry. Apart from providing scientific insight into complex nonlinear processes, mathematical models are fundamental for process simulation, optimization and control. In this context the new paradigmatic…

On Monday, January 22, 2018, at 16:00 Prof. Andrea Walther of Paderborn University will join the ALOP-Colloquium and present her recent work entitled:Recent progress in the optimization of piecewise smooth functionsIn a previous paper, we derived first and second order convexity conditions for a large class  of piecewise smooth functions.In that analysis based on piecewise linearization, a key assumption was the Linear Independence Kink Qualification (LIKQ), a generalization of the Linear Independence Constraint Qualification (LICQ) known from smooth nonlinear optimization.…

On Tuesday, February 6, 2018, at 12:00  Prof. Fredi Tröltzsch of TU Berlin will present his recent work entitled Optimal and Feedback Control of some Reaction-Diffusion EquationsThe optimal control of some systems of nonlinear reaction-diffusion equations is considered including several important equations of mathematical physics. In particular, equations are covered that develop traveling wave fronts, spiral waves, scroll rings, or propagating spot solutions. Well-posedness of the system, differentiability of the control-to-state mapping, and optimality conditions of first and second order are…

On Monday, April 16, 2018, at 16:00 Prof. Michael Günther of Bergische Universität Wuppertal will join the ALOP-Colloquium and present his recent work entitled Effiziente numerische Simulation multiphysikalischer Systeme Multiphysikalische Systeme werden oft durch Modelle beschrieben, die DAE-Netzwerkmodelle mit partiellen Differentialgleichungen über geeignete Randbedingungen und Quellterme koppeln. Nach Semidiskretisierung im Ort hat man es dann mit großen, gekoppelten DAE-Sytemen zu tun. In diesem Vortrag werden verschiedene Ansätze zu deren effizienter numerischer Simulation besprochen: Multirate-Verfahren und dynamsche Iteration.   The presentation…

On Monday, May 14, 2018, at 16:00,  Prof. Partha Lahiri of the University of Maryland College Park will join the ALOP-Colloquium and present his recent work entitled "Big data in official statistics." Abstract:  The demand for various socio-economic, transportation, and health statistics for small geographical areas is steadily increasing at a time when survey agencies are desperately looking for ways to reduce costs to meet fixed budgetary requirements.  In the current survey environment, the application of standard sample survey methods…

On Monday, October 29, 2018 at 16:00 c.t. Prof. Dr. Ir. Arie M.C. A. Koster  of RWTH Aachen will present his recent work entitled Robust Combinatorial Optimization - New Problems and Solutions Abstract: The growing need to deal with uncertainties in optimization processes has lead to many new research directions. In robust optimization, an uncertainty set has to be defined containing all scenarios to be considered. Availability of historical data often suggests the use of a discrete or polyhedral uncertainty…

On Monday, November 26, 2018 at 16:00 c.t.  Caroline Geiersbach of Universität Wien will present her recent work entitled   Stochastic Approximation for Shape Optimization     The presentation will take place in HS 9. Please join us for coffee at 15:45 in E10.

On Monday, December 3, 2018 at 16:00 c.t. Prof. Dr. Frank Vallentin of Universität Köln will present his recent work entitled "Chromatic numbers of geometric graphs" Abstract: A classical problem in discrete geometry (due to Hadwiger and Nelson) is to find the minimal number of colors one needs to color all points in the Euclidean plane so that no two points which are distance 1 apart receive the same color. Similar geometric coloring problems can be posed in the context…

On Monday, January 28, 2019 at 16:00 c.t.  Prof. Dr. Martin Gugat of FAU Erlangen will present his recent work entitled   On the limits of boundary stabilizability for networks of strings.   Abstract: An example by Bastin and Coron illustrates that theboundary stabilization of 1-d hyperbolic systemswith certain source terms is only possible if the lengthof the space interval is sufficiently small. We show that simlar phenomena also occur fornetworks of vibrating strings that are governedby the wave equation with…

On Monday, April 29 2019 at 16:00 c.t. Prof. Florian Jarre  of  Universität Düsseldorf will present his recent work. Stochastic gradient descent und Block coordinate descent -- eine Einführung in die Theorie und die praktische Anwendung   Der Vortrag befasst sich mit extrem hoch-dimensionalen speziell strukturierten Minimierungsproblemen, für die selbst die Auswertung eines einzelnen Funktionswertes oft so viel Rechenzeit beansprucht, dass neue iterative Verfahren zum Einsatz kommen, bei denen die einzelnen Iterationen billiger sind als eine Funktionsauswertung. Natürlich kann man…

On Monday, May 6 2019 at 16:00 c.t. Prof. Dr. Christian Meyer of TU Dortmund will present his recent work entitled Optimal control of a non-smooth semi-linear elliptic equation   The presentation will take place in HS 9.   Please join us for coffee at 15:45 in E10.

On Monday, June 17 2019 at 16:00 c.t. Prof. Dipl.-Ing. Dr. Barbara Kaltenbacher of AAU Klagenfurt will present her recent work entitled Optimization based formulation and regularization of inverse problems Abstract:   The conventional way of formulating inverse problems such as identification of a (possibly infinite dimensional) parameter, is via some forward operator, which is the concatenation of the observation operator with the parameter-to-state-map for the underlying model. Recently, all-at-once formulations have been considered as an alternative to this reduced…

On Monday, July 1 2019 at 16:00 c.t.  Dr. Christopher Hojny, TU Darmstadt  will present his recent work entitled Symmetry Handling in Binary Programs - Combining Symretopes and Orbital Fixing   Abstract: Branch-and-bound is an established method to solve binary programs with thousands of variables in adequate time. If symmetries are present, however, even small instances may be hard to solve, because symmetric parts of the branch-and-bound tree are inspected repeatedly without providing new information. A standard way to handle symmetries…

On Monday, November 4 2019 at 16:00 c.t.  Prof. Dr. Volker Kaibel, Otto-von-Guericke-Universität Magdeburg  will present his recent work entitled   Projections in Combinatorial Optimization Formulating problems via linear inequalities and projections is at the heart of the polyhedral combinatorics approach to Combinatorial Optimization. We present some examples for which this can be achieved with surprisingly few inequalities and we give an almost pictorial proof showing that for other problems exponentially many inequalities are required.   The presentation will take…

On Wednesday, December 4, 2019 at 12:00 c.t., Prof. Dr. Stefan Weltge, Assistant Professor at Technical University Munich (TUM) will present his recent work entitled Persistency of Linear Programming Relaxations for Stable Set Abstract:   The Nemhauser-Trotter theorem states that the standard linear programming (LP) relaxation for the stable set problem has a remarkable property, also known as the (weak) persistency property:  for every optimal LP solution that assigns integer values to some variables, there exists an optimal integer solution…

On Thursday, December 19 2019 at 16:00 c.t.  Dr. Martine Labbé, Université Libre de Bruxelles  will present her recent work Title and Abstract will follow.   The presentation will take place in HS 9. Please join us for coffee at 15:45 in E10.

CANCELLED DUE TO THE CURRENT TRAVEL RESTRICTIONS IN CHINA This presentation will be rescheduled at a later time. On Monday, February 10 2020 at 16:00 c.t.  Dr. Shengfeng Zhu of East China Normal University will present his recent work entitled Finite element approximations of shape gradients with applications in shape optimization  Abstract: Shape optimization has many practical applications in science and engineering. Boundary type Eulerian derivative has been widely used in shape gradient algorithms. The distributed Eulerian derivative is seldom…

On Monday, February 24 2020 at 16:00 c.t.  Dr. Marianna de Santis, Università de Roma, DIAG  will present her recent work entitled Branch-and-bound Algorithms for structured Mixed Integer Nonlinear Programming Problems Abstract: Mixed Integer Nonlinear Programming (MINLP) is the area of optimization  that addresses nonlinear problems with continuous and integer variables.  MINLP has proven to be a powerful tool for modeling and it combines challenges from both combinatorial and nonlinear optimization. In this talk, we deal with the computation of…

On Tuesday, March 3 2020 at 16:00 c.t.  Prof. Dr. Hanno Gottschalk  , Bergische Universität Wuppertal  will present his recent work. entitled False Positives and False Negatives in Semantic Segmentation: Toward the assurance of the perception with deep CNN in atonomous driving Abstract: The application of machine learning technology in safety relevant environments poses several challenges regarding their reliability. This especially applies to modern deep learning architectures, which pretty much resemble a black box. In this talk, measures of uncertainty…

On Monday, April 11, 2022, at 16:00 c.t., Dr. Akhil Vohra, University of Cambridge will speak on the topic of Bayesian Persuasion: Reduced Form Approach. Abstract: We illustrate the usefulness of reduced form representations of Bayesian persuasion problems with two applications. In one, the reduced form representation yields a simple algorithm to determine the support of the optimal solution. In the second, the reduced form leads to a simple greedy algorithm to determine the maximum value a sender can achieve…