Denis Aßmann

Mr. Denis Aßmann


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
1 December 2017 in Data
Verified
Journal Article
Open access
PDF file
MSMartin Schmidt
Martin Schmidt
DADenis Aßmann
Denis Aßmann
RBRobert Burlacu
Robert Burlacu
JHJesco Humpola
Jesco Humpola
IJImke Joormann
Imke Joormann
MSMathias Sirvent
Mathias Sirvent
The development of mathematical simulation and optimization models and algorithms for solving gas transport problems is an active field of research. In order to test and compare these models and algorithms, gas network instances together with demand data are needed. The goal of GasLib is to provide a set of publicly available gas network instances that can be used by researchers in the field of gas transport. The advantages are that researchers save time by using these instances and that different models and algorithms can be compared on the same specified test sets. The library instances are encoded in an XML (extensible markup language) format. In this paper, we explain this format and present the instances that are available in the library.

17 January 2019 in Networks
Verified
Journal Article
Closed access
PDF file
DADenis Aßmann
Denis Aßmann
FLFrauke Liers
Frauke Liers
MSMichael Stingl
Michael Stingl

1 January 2018 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
DADenis Aßmann
Denis Aßmann
FLFrauke Liers
Frauke Liers
MSMichael Stingl
Michael Stingl
JVJuan C. Vera
Juan C. Vera
In this paper we study feasibility and infeasibility of nonlinear two-stage fully adjustable robust feasibility problems with an empty first stage. This is equivalent to deciding whether the uncertainty set is contained within the projection of the feasible region onto the uncertainty-space. Moreover, the considered sets are assumed to be described by polynomials. For answering this question, two very general approaches using methods from polynomial optimization are presented---one for showing feasibility and one for showing infeasibility. The developed methods are approximated through sum of squares (SOS) polynomials and solved using semidefinite programs. Deciding robust feasibility and infeasibility is important for gas network operations, which is a nonconvex feasibility problem where the feasible set is described by a composition of polynomials with the absolute value function. Concerning the gas network problem, different topologies are considered. It is shown that a tree structured network can be decided exactly using linear programming. Furthermore, a method is presented to reduce a tree network with one additional arc to a single cycle network. In this case, the problem can be decided by eliminating the absolute value functions and solving the resulting linearly many polynomial optimization problems. Lastly, the effectivity of the methods is tested on a variety of small cyclic networks. It turns out that for instances where robust feasibility or infeasibility can be decided successfully, level 2 or level 3 of the Lasserre relaxation hierarchy typically is sufficient.

10 November 2020 in Vietnam Journal of Mathematics
Verified
Journal Article
Open access
PDF file
DADennis Adelhütte
Dennis Adelhütte
DADenis Aßmann
Denis Aßmann
TGTatiana Gonzàlez Grandòn
Tatiana Gonzàlez Grandòn
MGMartin Gugat
Martin Gugat
HHHolger Heitsch
Holger Heitsch
DWDavid Wintergerst
David Wintergerst
Optimization problems under uncertain conditions abound in many real-life applications. While solution approaches for probabilistic constraints are often developed in case the uncertainties can be assumed to follow a certain probability distribution, robust approaches are usually applied in case solutions are sought that are feasible for all realizations of uncertainties within some predefined uncertainty set. As many applications contain different types of uncertainties that require robust as well as probabilistic treatments, we deal with a class of joint probabilistic/robust constraints. Focusing on complex uncertain gas network optimization problems, we show the relevance of this class of problems for the task of maximizing free booked capacities in an algebraic model for a stationary gas network. We furthermore present approaches for finding their solution. Finally, we study the problem of controlling a transient system that is governed by the wave equation. The task consists in determining controls such that a certain robustness measure remains below some given upper bound with high probability.

30 August 2018 in arXiv
Verified
Preprint
Open access
PDF file
DADenis Aßmann
Denis Aßmann
FLFrauke Liers
Frauke Liers
MSMichael Stingl
Michael Stingl
JVJuan C. Vera
Juan C. Vera
In this paper we study feasibility and infeasibility of nonlinear two-stage fully adjustable robust feasibility problems with an empty first stage. This is equivalent to deciding whether the uncertainty set is contained within the projection of the feasible region onto the uncertainty-space. Moreover, the considered sets are assumed to be described by polynomials. For answering this question, two very general approaches using methods from polynomial optimization are presented - one for showing feasibility and one for showing infeasibility. The developed methods are approximated through sum of squares polynomials and solved using semidefinite programs. Deciding robust feasibility and infeasibility is important for gas network operations, which is a nonconvex feasibility problem where the feasible set is described by a composition of polynomials with the absolute value function. Concerning the gas network problem, different topologies are considered. It is shown that a tree structured network can be decided exactly using linear programming. Furthermore, a method is presented to reduce a tree network with one additional arc to a single cycle network. In this case, the problem can be decided by eliminating the absolute value functions and solving the resulting linearly many polynomial optimization problems. Lastly, the effectivity of the methods is tested on a variety of small cyclic networks. It turns out that for instances where robust feasibility or infeasibility can be decided successfully, level 2 or level 3 of the Lasserre relaxation hierarchy typically is sufficient.