80 citations · 93 across the 8 of their papers we have counts for
10 papers
On Convergence of Binary Trust-Region Steepest Descent
Paul Manns, Mirko Hahn, Christian Kirches +2
Binary trust-region steepest descent (BTR) and combinatorial integral approximation (CIA) are two recently investigated approaches for the solution of optimization problems with di…
Liftings of polynomial systems decreasing the mixed volume
Christopher Borger, Thomas Kahle, Andreas Kretschmer +2
The BKK theorem states that the mixed volume of the Newton polytopes of a system of polynomial equations upper bounds the number of isolated torus solutions of the system. Homotopy…
A finite element / neural network framework for modeling suspensions of non-spherical particles. Concepts and medical applications
Martyna Minakowska, Thomas Richter, Sebastian Sager
An accurate prediction of the translational and rotational motion of particles suspended in a fluid is only possible if a complete set of correlations for the force coefficients of…
Model-based optimal AML consolidation treatment
Felix Jost, Enrico Schalk, Daniela Weber +3
Neutropenia is an adverse event commonly arising during intensive chemotherapy of acute myeloid leukemia (AML). It is often associated with infectious complications. Mathematical m…
Model-based simulation of maintenance therapy of childhood acute lymphoblastic leukemia
Felix Jost, Jakob Zierk, Thuy T. T. Le +6
Acute lymphoblastic leukemia is the most common malignancy in childhood. Successful treatment requires initial high-intensity chemotherapy, followed by low-intensity oral maintenan…
The asymptotic error of chaos expansion approximations for stochastic differential equations
Tony Huschto, Mark Podolskij, Sebastian Sager
In this paper we present a numerical scheme for stochastic differential equations based upon the Wiener chaos expansion. The approximation of a square integrable stochastic differe…
Convexification of box-constrained polynomial optimization problems via monomial patterns
Gennadiy Averkov, Benjamin Peters, Sebastian Sager
Convexification is a core technique in global polynomial optimization. Currently, there are two main approaches competing in theory and practice: the approach of nonlinear programm…
Solving Quadratic Programs to High Precision using Scaled Iterative Refinement
Tobias Weber, Sebastian Sager, Ambros Gleixner
Quadratic optimization problems (QPs) are ubiquitous, and solution algorithms have matured to a reliable technology. However, the precision of solutions is usually limited due to t…
Synthesis of optimal controls and numerical optimization for the vibration-based energy harvesters
Thuy T. T. Le, Binh D. Truong, Felix Jost +3
This work is devoted to demonstration of the analysis on optimizing the output power harvested from vibration energy harvester.
Relaxation Methods for Mixed-Integer Optimal Control of Partial Differential Equations
Falk M. Hante, Sebastian Sager
We consider integer-restricted optimal control of systems governed by abstract semilinear evolution equations. This includes the problem of optimal control design for certain distr…