Logo TU Ilmenau

Foto des Ansprechpartners

Prof. Dr. rer. nat. habil. Matthias Kriesell


Telefon +49 3677 69-3633

E-Mail senden

Ihre Position



Veröffentlichungen am Institut für Mathematik seit 1990

Anzahl der Treffer: 1160
Erstellt: Thu, 05 Dec 2019 23:09:48 +0100 in 0.0263 sec

Fabrici, Igor; Harant, Jochen; Mohr, Samuel; Schmidt, Jens M.;
Longer cycles in essentially 4-connected planar graphs. - In: Discussiones mathematicae - Warsaw : De Gruyter Open, ISSN 2083-5892, Bd. 40 (2020), 1, S. 269-277
Harant, Jochen; Jendrol', Stanislav;
Lightweight paths in graphs. - In: Opuscula mathematica : semiannual. - Kraków : AGH Univ. of Science and Technology Press, Bd. 39 (2019), 6, S. 623-649
Gernandt, Hannes;
Locating the extremal entries of the Fiedler vector for rose trees. - In: Proceedings in applied mathematics and mechanics : PAMM. - Weinheim [u.a.] : Wiley-VCH, ISSN 1617-7061, Volume 19 (2019), issue 1, e201900408, 2 Seiten
Behrndt, Jussi; Schmitz, Philipp; Trunk, Carsten;
The non-real spectrum of a singular indefinite Sturm-Liouville operator with regular left endpoint. - In: Proceedings in applied mathematics and mechanics : PAMM. - Weinheim [u.a.] : Wiley-VCH, ISSN 1617-7061, Volume 19 (2019), issue 1, e201900133, 2 Seiten
Zimmermann, Armin; Hotz, Thomas;
Integrating simulation and numerical analysis in the evaluation of generalized stochastic Petri nets. - In: ACM transactions on modeling and computer simulation : TOMACS. - New York, NY : ACM Press, ISSN 1558-1195, Bd. 29 (2019), 4, S. 24:1-24:25
Baier, Robert; Eichfelder, Gabriele; Gerlach, Tobias;
Optimality conditions for set optimization using a directional derivative based on generalized Steiner sets - Ilmenau : Technische Universität Ilmenau, Institut für Mathematik, 2019 - 1 Online-Ressource (40 Seiten). . - (Preprint. - M19,09)

Set-optimization has attracted increasing interest in the last years, as for instance uncertain multiobjective optimization problems lead to such problems with a set- valued objective function. Thereby, from a practical point of view, most of all the so-called set approach is of interest. However, optimality conditions for these problems, for instance using directional derivatives, are still very limited. The key aspect for a useful directional derivative is the definition of a useful set difference for the evaluation of the numerator in the difference quotient. We present here a new set difference which avoids the use of a convex hull and which applies to arbitrary convex sets, and not to strictly convex sets only. The new set difference is based on the new concept of generalized Steiner sets. We introduce the Banach space of generalized Steiner sets as well as an embedding of convex sets in this space using Steiner points. In this Banach space we can easily define a difference and a directional derivative. We use the latter for new optimality conditions for set optimization. Numerical examples illustrate the new concepts.
Preißer, Johanna E.; Schmidt, Jens M.;
Computing vertex-disjoint paths in large graphs using MAOs. - In: Algorithmica : an international journal in computer science. - New York, NY : Springer, ISSN 1432-0541, (2019), insges. 17 S.
First Online: 17 July 2019
Eichfelder, Gabriele; Gerlach, Tobias;
On classes of set optimization problems which are reducible to vector optimization problems and its impact on numerical test instances. - In: Variational analysis and set optimization - Boca Raton : CRC Press, (2019), S. 265-290

Set optimization with the set approach has recently gained increasing interest due to its practical relevance. In this problem class one studies optimization problems with a set-valued objective map and defines optimality based on a direct comparison of the images of the objective function, which are sets here. Meanwhile, in the literature a wide range of theoretical tools as scalarization approaches and derivative concepts as well as first numerical algorithms are available. These numerical algorithms require on the one hand test instances where the optimal solution sets are known. On the other hand, in most examples and test instances in the literature only set-valued maps with a very simple structure are used. We study in this paper such special set-valued maps and we show that some of them are such simple that they can equivalently be expressed as a vector optimization problem. Thus we try to start drawing a line between simple set-valued problems and such problems which have no representation as multiobjective problems. Those having a representation can be used for defining test instances for numerical algorithms with easy verifiable optimal solution set.

Leben, Florian; Trunk, Carsten;
Operator-based approach to PT-symmetric problems on a wedge-shaped contour. - In: Quantum studies : mathematics and foundations. - Berlin : Springer, ISSN 2196-5617, Bd. 6 (2019), 3, S. 315-333
Huang, Junjie; Sun, Junfeng; Chen, Alatancang; Trunk, Carsten;
Invertibility of 2 × 2 operator matrices. - In: Mathematische Nachrichten - [S.l.] : Wiley-VCH, ISSN 1522-2616, Bd. 292 (2019), 11, S. 2411-2426