http://www.tu-ilmenau.de

Logo TU Ilmenau



Photo of the Contact Person
Contact Person

Prof. Dr. Michael Stiebitz

Head of Institute

Phone +49 3677 69-3633

Send email


INHALTE

Publications

Publications at the institute since 1990

Anzahl der Treffer: 1182
Erstellt: Sun, 29 Mar 2020 08:17:31 +0200 in 0.0366 sec


Ilchmann, Achim;
Die Baugeschichte eines Rokoko-Stadthauses. - Erfurt : Ulenspiegel, 2018. - 253 Seiten. ISBN 978-3-932655-56-2

Ilchmann, Achim; Witschel, Jonas; Worthmann, Karl;
Model predictive control for linear DAEs without terminal constraints and costs. - In: IFAC-PapersOnLine. - Frankfurt : Elsevier, ISSN 2405-8963, Bd. 51 (2018), 20, S. 116-121

https://doi.org/10.1016/j.ifacol.2018.11.002
Schulze Darup, Moritz; Worthmann, Karl;
Tailored MPC for mobile robots with very short prediction horizons. - In: 2018 European Control Conference (ECC) : 12-15 June 2018.. - [Piscataway, NJ] : IEEE, (2018), S. 1361-1366

https://doi.org/10.23919/ECC.2018.8550514
Ilchmann, Achim; Witschel, Jonas; Worthmann, Karl;
Model predictive control for linear differential-algebraic equations. - In: IFAC-PapersOnLine. - Frankfurt : Elsevier, ISSN 2405-8963, Bd. 51 (2018), 20, S. 98-103

https://doi.org/10.1016/j.ifacol.2018.10.181
Preißer, Johanna E.; Schmidt, Jens M.;
Computing vertex-disjoint paths in large graphs using MAOs. - In: 29th International Symposium on Algorithms and Computation : ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan.. - Saarbrücken/Wadern, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, (2018), Seite 13:1-13:12

http://dx.doi.org/10.4230/LIPIcs.ISAAC.2018.13
Lo, On-Hei Solomon; Schmidt, Jens M.;
A cut tree representation for pendant pairs. - In: 29th International Symposium on Algorithms and Computation : ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan.. - Saarbrücken/Wadern, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, (2018), Seite 38:1-38:9

http://dx.doi.org/10.4230/LIPIcs.ISAAC.2018.38
Schmid, Andreas; Schmidt, Jens M.;
Computing Tutte paths. - In: 45th International Colloquium on Automata, Languages, and Programming : ICALP 2018, Prague, Czech Republic, July 9-13, 2018.. - Saarbrücken/Wadern, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, (2018), Seite 98:1-98.14

http://dx.doi.org/10.4230/LIPIcs.ICALP.2018.98
Lo, On-Hei Solomon; Schmidt, Jens M.;
Longest cycles in cyclically 4-edge-connected cubic planar graphs. - In: The Australasian journal of combinatorics. - Queensland : Centre for Discrete Mathematics and Computing, Univ. of Queensland, ISSN 1034-4942, Bd. 72 (2018), Part 1, Seite 155-162

https://nbn-resolving.org/urn:nbn:de:gbv:ilm1-2018200173
Jacob, Birgit; Tretter, Christiane; Trunk, Carsten; Vogt, Hendrik;
Systems with strong damping and their spectra. - In: Mathematical methods in the applied sciences. - Chichester, West Sussex : Wiley, ISSN 1099-1476, Bd. 41 (2018), 16, S. 6546-6573

https://doi.org/10.1002/mma.5166
Eichfelder, Gabriele; Niebling, Julia; Rocktäschel, Stefan;
An algorithmic approach to multiobjective optimization with decision uncertainty. - Ilmenau : Technische Universität Ilmenau, Institut für Mathematik, 2018. - 1 Online-Ressource (23 Seiten). . - (Preprint. - M18,11)

In real life applications optimization problems with more than one objective function are often of interest. Next to handling multiple objective functions, another challenge is to deal with uncertainties concerning the realization of the decision variables. One approach to handle these uncertainties is to consider the objectives as set-valued functions. Hence, the image of one variable is a whole set, which includes all possible outcomes of this variable. We choose a robust approach and thus these sets have to be compared using the so called upper-type less order relation. We propose a numerical method to calculate a covering of the set of optimal solutions of such an uncertain multiobjective optimization problem. We use a branchand-bound approach and lower and upper bound sets for being able to compare the arising sets. The calculation of these lower and upper bound sets uses techniques known from global optimization as convex underestimators as well as techniques used in convex multiobjective optimization as outer approximation techniques. We also give first numerical results for this algorithm.



https://nbn-resolving.org/urn:nbn:de:gbv:ilm1-2018200159