A New Approach in Deterministic Global Optimisation of Problems with Ordinary Differential Equations
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...
In this thesis we explore uncertainty quantification of forward and inverse problems involving differential equations. Differential equations are widely employed for modeling natural and social phenomena, with applications in engineering, chemistry, meteor ...
The concept of reaction variants and invariants for lumped reaction systems has been known for several decades. Its applications encompass model identification, data reconciliation, state estimation and control using kinetic models. In this thesis, the con ...
Analysis-suitable T-splines (ASTS) including both extraordinary points and T-junctions are used to solve Kirchhoff-Love shell problems. Extraordinary points are required to represent surfaces with arbitrary topological genus. T-junctions enable local refin ...
The central task in many interactive machine learning systems can be formalized as the sequential optimization of a black-box function. Bayesian optimization (BO) is a powerful model-based framework for \emph{adaptive} experimentation, where the primary go ...
We consider online convex optimization with a zero-order oracle feedback. In particular, the decision maker does not know the explicit representation of the time-varying cost functions, or their gradients. At each time step, she observes the value of the c ...
The main topics of this thesis are distributed estimation and cooperative path-following in the presence of communication constraints, with applications to autonomous marine vehicles. To this end, we study algorithms that take explicitly into account the c ...
The contribution of this article is to propose and experimentally validate an optimizing control strategy for power kites flying crosswind. The control strategy provides both path control (stability) and path optimization (efficiency). The path following p ...
Institute of Electrical and Electronics Engineers2018
We introduce the elliptical Ornstein-Uhlenbeck (OU) process, which is a generalisation of the well-known univariate OU process to bivariate time series. This process maps out elliptical stochastic oscillations over time in the complex plane, which are obse ...
We propose a noise robust two-step phase shifting algorithm for the evaluation of random and unknown phase step. In this algorithm, the phase within a small size two-dimensional window around a user selected pixel in an interferogram is approximated as a q ...
