Packing bounds for outer products with applications to compressive sensing. - In: Geometric science of information, (2019), S. 135-143
Applications of differential-algebraic equations: examples and benchmarks. - Cham : Springer, 2019. - vii, 320 Seiten. - (Differential-algebraic equations forum) ISBN 3-030-03717-7
Literaturangaben
General Nonlinear Differential Algebraic Equations and Tracking Problems: A Robotics Example -- DAE Aspects in Vehicle Dynamics and Mobile Robotics -- Open-loop Control of Underactuated Mechanical Systems Using Servo-constraints: Analysis and Some Examples -- Systems of Differential Algebraic Equations in Computational Electromagnetics -- Gas Network Benchmark Models -- Topological Index Analysis Applied to Coupled Flow Networks -- Nonsmooth DAEs with Applications in Modeling Phase Changes -- Continuous, Semi-Discrete, and Fully Discretized Navier-Stokes Equations
Clique-factors in sparse pseudorandom graphs. - In: European journal of combinatorics, Bd. 82 (2019), S. 102999
https://doi.org/10.1016/j.ejc.2019.102999
Shocks in the light of discrete velocity models. - In: AIP conference proceedings, ISSN 1551-7616, Bd. 2132 (2019), 060002, insges. 8 S.
https://doi.org/10.1063/1.5119542
A trust-region algorithm for heterogeneous multiobjective optimization. - In: SIAM journal on optimization, ISSN 1095-7189, Bd. 29 (2019), 2, S. 1017-1047
https://doi.org/10.1137/18M1173277
On Selkow's bound on the independence number of graphs. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 39 (2019), 3, S. 655-657
https://doi.org/10.7151/dmgt.2100
Empiric experiments with text-representing centroids. - In: Theory and application of text-representing centroids, (2019), S. 39-54
Spreading activation: a fast calculation method for text centroids. - In: Theory and application of text-representing centroids, (2019), S. 27-38
On a class of non-Hermitian matrices with positive definite Schur complements. - In: Proceedings of the American Mathematical Society, ISSN 1088-6826, Bd. 147 (2019), 6, S. 2375-2388
https://doi.org/10.1090/proc/14412
Solving multiobjective mixed integer convex optimization problems. - Ilmenau : Technische Universität Ilmenau, Institut für Mathematik, 2019. - 1 Online-Ressource (26 Seiten). - (Preprint ; M19,06)
Multiobjective mixed integer convex optimization refers to mathematical programming problems where more than one convex objective function needs to be optimized simultaneously and some of the variables are constrained to take integer values. We present a branch-and-bound method based on the use of properly defined lower bounds. We do not simply rely on convex relaxations, but we built linear outer approximations of the image set in an adaptive way. We are able to guarantee correctness in terms of detecting both the efficient and the nondominated set of multiobjective mixed integer convex problems according to a prescribed precision. As far as we know, the procedure we present is the first deterministic algorithm devised to handle this class of problems. Our numerical experiments show results on biobjective and triobjective mixed integer convex instances.
https://www.db-thueringen.de/receive/dbt_mods_00038620