The impact of modern technology on genetic epidemiology has been significant, with studies
comprising millions of individuals assessed at tens of millions of genetic variants now …

We extend recent work on solving mixed-integer nonlinear optimal control problems
(MIOCPs) to the case of integer control functions subject to constraints that involve a …

The standard paradigm in neural architecture search (NAS) is to search for a fully
deterministic architecture with specific operations and connections. In this work, we instead …

Human gait patterns have been intensively studied, both from medical and engineering
perspectives, to understand and compensate pathologies. However, the muscle-force …

Standard quadratic optimization problems (StQPs) provide a versatile modelling tool in
various applications. In this paper, we consider StQPs with a hard sparsity constraint …

The problem of minimizing a polynomial over the standard simplex is one of the basic NP-
hard nonlinear optimization problems—it contains the maximum clique problem in graphs as …

We study the problem of designing dynamic intervention policies for minimizing cascading
failures in online financial networks, as well we more general demand-supply networks …

We study the problem of a decision maker who must provide the best possible treatment
recommendation based on an experiment. The desirability of the outcome distribution …

We study the minimization of fixed-degree polynomials over the simplex. This problem is
well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as …

Let $ f $ be a nonnegative function supported on $(-1/4, 1/4) $. We show that\[\sup _
{x\in\mathbb {R}}{\int _ {\mathbb {R}}{f (t) f (xt) dt}}\geq 1.28\left (\int _ {-1/4}^{1/4}{f (x) …