Controlling the dynamics of large-scale networks is essential for a macroscopic reduction of overall consumption and losses in the context of energy supply, finance, logistics, and mobility. We investigate the optimal control of semilinear dynamical systems on asymptotically infinite networks, using the notion of graphons. Graphons represent a limit object of a converging graph sequence … Read more
Active research on optimal control methods comprises the developments of research groups from various fields, including control, mathematics, and process systems engineering. Although there is a consensus on the classification of the main solution methods, different terms are often used for the same method. For example, solving optimal control problems with control discretization and embedded … Read more
Graphons generalize graphs and define a limit object of a converging graph sequence. The notion of graphons allows for a generic representation of coupled network dynamical systems. We are interested in approximating optimal switching controls for graphon dynamical systems. To this end, we apply a decomposition approach comprised of a relaxation and a reconstruction step. … Read more
This paper considers convex quadratic programs associated with the training of support vector machines (SVM). Exploiting the special structure of the SVM problem a new type of active set method with long cycles and stable rank-one-updates is proposed and tested (CMU: cycling method with updates). The structure of the problem allows for a repeated simple … Read more
This paper proposes a universal, optimal algorithm for convex minimization problems of the composite form $g_0(x)+h(g_1(x),\dots, g_m(x)) + u(x)$. We allow each $g_j$ to independently range from being nonsmooth Lipschitz to smooth, from convex to strongly convex, described by notions of H\”older continuous gradients and uniform convexity. Note that, although the objective is built from … Read more
We are concerned with contingent derivatives and their second-order counterparts (introduced by Ngai et al.) of set-valued mappings. Special attention is given to the development of new sum-rules for second-order contingent derivatives. To be precise, we want to find conditions under which the second-order contingent derivative of the sum of a smooth and a set-valued … Read more
In this work we propose a generalization of the Spherical Support Vector Machine method, in which the separator is a sphere, applied to Interval-valued data. This type of data belongs to a more general class, known as Symbolic Data, for which features are described by sets, intervals or histograms instead of classic arrays. This paradigm … Read more
General quadratically constrained quadratic programs (QCQPs) are challenging to solve as they are known to be NP-hard. A popular approach to approximating QCQP solutions is to use semidefinite programming (SDP) relaxations. It is well-known that the optimal value η of the SDP relaxation problem bounds the optimal value ζ of the QCQP from below, i.e., … Read more
This paper investigates the problem of minimizing a smooth function over a compact set with a probabilistic relative-error gradient oracle. The oracle succeeds with some probability, in which case it provides a relative-error approximation of the true gradient, or fails and returns an arbitrary vector, while the optimizer cannot distinguish between successful and failed queries … Read more
The representation of a function in a higher-dimensional space is often referred to as lifting. Liftings can be used to reduce complexity. We are interested in the question of how liftings affect the local convergence of Newton’s method. We propose algorithms to construct liftings that potentially reduce the number of iterations via analysis of local … Read more