Aktuelle Veröffentlichungen

Eric Schulze and Matthias Stein
Simulation of Mixed Self-Assembled Monolayers on Gold: Effect of Terminal Alkyl Anchor Chain and Monolayer Composition
The Journal of Physical Chemistry B, 122 (31), pp 7699–7710, published online 20 July 2018
DOI: 10.1021/acs.jpcb.8b05075

Peter Benner, Pawan Goyal, and Serkan Gugercin
H2-Quasi-Optimal Model Order Reduction for Quadratic-Bilinear Control Systems
SIAM Journal on Matrix Analysis and Applications, Vol. 39, Issue 2, pp. 983-1032, published online 5 June 2018
DOI: 10.1137/16M1098280

Thomas Beneyton, Dorothee Krafft, Claudia Bednarz, Christin Kleineberg, Christian Woelfer, Ivan Ivanov, Tanja Vidakovic-Koch, Kai Sundmacher und Jean-Christophe Baret
Out-of-equilibrium microcompartments for the bottom-up integration of metabolic functions
Nature Communications, 19 June 2018
DOI: 10.1038/s41467-018-04825-1

Petra Schwille, Joachim Spatz, Katharina Landfester, Eberhard Bodenschatz, Stephan Herminghaus,Victor Sourjik, Tobias Erb, Philippe Bastiaens, Reinhard Lipowsky, Anthony Hyman, Peter Dabrock, Jean-Christophe Baret, Tanja Vidakovic-Koch, Peter Bieling, Rumiana Dimova, Hannes Mutschler, Tom Robinson,Dora Tang, Seraphine Wegner, Kai Sundmacher
MaxSynBio ‐ Avenues towards creating cells from the bottom up
Angewandte Chemie, 11 May 2018
DOI: 10.1002/ange.201802288

Zu ausgewählten Publikationen ...


Willkommen am Max-Planck-Institut Magdeburg


MALOC Event Series

3439 1446721298

Magdeburg Lectures on Optimization and Control: No Small Linear Program Approximates Vertex Cover within a Factor 2-ε

The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev (2003) proved that the problem is NP-hard to approximate within a factor 2-ε, assuming Khot's famous Unique Games Conjecture (UGC). This is tight because the problem has an easy 2-approximation algorithm. We prove the following unconditional result about linear programming (LP) relaxations of the problem: every LP relaxation that approximates vertex cover within a factor 2-ε has super-polynomially many inequalities. [mehr]

MALOC Event Series

3889 1452171036

Magdeburg Lectures on Optimization and Control: "Concepts of Function Space Oriented Optimization"

Many large scale nonlinear optimization problems are discretizations of optimization problems in function space and thus, we expect that additional functional analytic structure should be present. The goal of function space oriented optimization is to exploit this structure. This may comprise the efficient computation of steps by iterative solvers, problem suited globalization strategies, or the use of adaptive mesh refinement inside an optimization method. In this talk we will give an overview of a couple of ideas, and explain at concrete examples how they can be implemented. Short CV Anton Shiela is a professor for applied mathematics at the University of Bayreuth. His fields of research are optimization with PDEs, in particular the development of algorithms for the solution of optimization problems in function space. Before moving to Bayreuth in 2014, he was an associate professor at Technische Universitaet Hamburg-Harburg (2013-2014) and Matheon junior reseach group leader at TU Berlin (2012-2013). He got his PhD in 2007 at Zuse Institute Berlin, where he worked as a reasearch assistant (2002-2012). [mehr]

Magdeburg Lectures on Optimization and Control: Optimal control, optimization, market mechanisms and physics of smart energy systems

Zur Redakteursansicht
loading content