Fredrik Magnusson

Mr. Fredrik Magnusson


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 June 2015 in Processes
Verified
Journal Article
Open access
PDF file
FMFredrik Magnusson
Fredrik Magnusson
JÅJohan Åkesson
Johan Åkesson
We present the open-source software framework in JModelica.org for numerically solving large-scale dynamic optimization problems. The framework solves problems whose dynamic systems are described in Modelica, an open modeling language supported by several different tools. The framework implements a numerical method based on direct local collocation, of which the details are presented. The implementation uses the open-source third-party software package CasADi to construct the nonlinear program in order to efficiently obtain derivative information using algorithmic differentiation. The framework is interfaced with the numerical optimizers IPOPT and WORHP for finding local optima of the optimization problem after discretization. We provide an illustrative example based on the Van der Pol oscillator of how the framework is used. We also present results for an industrially relevant problem regarding optimal control of a distillation column.

1 May 2014 in Chemical Engineering Science
Verified
Journal Article
Closed access
AHAnders Holmqvist
Anders Holmqvist
TTT. Törndahl
T. Törndahl
FMFredrik Magnusson
Fredrik Magnusson
UZUwe Zimmermann
Uwe Zimmermann
SSS. Stenström
S. Stenström

16 July 2015 in Processes
Verified
Journal Article
Open access
PDF file
AHAnders Holmqvist
Anders Holmqvist
CAChristian Andersson
Christian Andersson
FMFredrik Magnusson
Fredrik Magnusson
JÅJohan Åkesson
Johan Åkesson
This contribution concerns the development of generic methods and tools for robust optimal control of high-pressure liquid chromatographic separation processes. The proposed methodology exploits a deterministic robust formulation, that employs a linearization of the uncertainty set, based on Lyapunov differential equations to generate optimal elution trajectories in the presence of uncertainty. Computational tractability is obtained by casting the robust counterpart problem in the framework of bilevel optimal control where the upper level concerns forward simulation of the Lyapunov differential equation, and the nominal open-loop optimal control problem augmented with the robustified target component purity inequality constraint margin is considered in the lower level. The lower-level open-loop optimal control problem, constrained by spatially discretized partial differential equations, is transcribed into a finite dimensional nonlinear program using direct collocation, which is then solved by a primal-dual interior point method. The advantages of the robustification strategy are highlighted through the solution of a challenging ternary complex mixture separation problem for a hydrophobic interaction chromatography system. The study shows that penalizing the changes in the zero-order hold control gives optimal solutions with low sensitivity to uncertainty. A key result is that the robustified general elution trajectories outperformed the conventional linear trajectories both in terms of recovery yield and robustness.

1 September 2014 in Chemical Engineering Science
Verified
Journal Article
Closed access
AHAnders Holmqvist
Anders Holmqvist
FMFredrik Magnusson
Fredrik Magnusson
SSS. Stenström
S. Stenström

2 January 2017 in Optimization Methods and Software
Verified
Journal Article
Closed access
FMFredrik Magnusson
Fredrik Magnusson
JÅJohan Åkesson
Johan Åkesson
We consider dynamic optimization problems for systems described by differential-algebraic equations (DAEs). Such problems are usually solved by discretizing the full DAE. We propose techniques to symbolically eliminate many of the algebraic variables in a preprocessing step before discretization. These techniques are inspired by the causalization and tearing techniques often used when solving DAE initial value problems. Since sparsity is crucial for some dynamic optimization methods, we also propose a novel approach to preserving sparsity during this procedure. The proposed methods have been implemented in the open-source JModelica.org platform. We evaluate the performance of the methods on a suite of optimal control problems solved using direct collocation. We consider both computational time and probability of solving the problem in a timely manner. We demonstrate that the proposed methods often are an order of magnitude faster than the standard way of discretizing the full DAE, and also significantly increase probability of successful convergence.