Aktuelle Veröffentlichungen

Xing Liu, Justin M. Reitsma, Jennifer L. Mamrosh, Yaru Zhang, Ronny Straube, Raymond J. Deshaies
Cand1-mediated adaptive exchange mechanism enables variation in F-box protein expression
Molecular Cell, Volume 69, Issue 5, pp 773 - 786, 1. März 2018
DOI: 10.1016/j.molcel.2018.01.038

Susann Triemer, Kerry Gilmore, Giang T. Vu, Peter H. Seeberger, Andreas Seidel-Morgenstern
Literally green chemical synthesis of artemisinin from plant extracts
Angewandte Chemie International Edition, 21. Februar 2018
DOI: 10.1002/anie.201801424

Björn-Johannes Harder, Katja Bettenbrock, Steffen Klamt
Temperature-dependent dynamic control of the TCA cycle increases volumetric productivity of itaconic acid production by Escherichia coli.
Biotechnology and Bioengineering, Volume 115, Ausgabe 1, Seiten 156–164, Januar 2018, DOI: 10.1002/bit.26446
Open Access Artikel

Lihong Feng , Athanasios C. Antoulas und Peter Benner
Some a posteriori error bounds for reduced-order modelling of (non-)parametrized linear systems
ESAIM: Mathematical Modelling and Numerical Analysis, Volume 51, Number 6, 27. November 2017
DOI: 10.1051/m2an/2017014

Lado Otrin, Nika Marušič, Claudia Bednarz, Tanja Vidaković-Koch, Ingo Lieberwirth, Katharina Landfester und Kai Sundmacher
Toward Artificial Mitochondrion: Mimicking Oxidative Phosphorylation in Polymer and Hybrid Membranes
Nano Letters, 17 (11), pp 6816–6821, 25. Oktober 2017
DOI: 10.1021/acs.nanolett.7b03093

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