Publications

2020

• State-constrained control-affine parabolic problems I: First and Second order necessary optimality conditions
  
  • Aronna M Soledad
  • Bonnans J. Frederic
  • Kröner Axel
  Set-Valued and Variational Analysis, Springer, 2020. In this paper we consider an optimal control problem governed by a semilinear heat equation with bilinear control-state terms and subject to control and state constraints. The state constraints are of integral type, the integral being with respect to the space variable. The control is multidimen-sional. The cost functional is of a tracking type and contains a linear term in the control variables. We derive second order necessary conditions relying on the concept of alternative costates and quasi-radial critical directions. The appendix provides an example illustrating the applicability of our results.
• Error estimates for phase recovering from phaseless scattering data
  
  • Novikov Roman
  • Sivkin Vladimir
  Eurasian Journal of Mathematical and Computer Applications, Eurasian National University, Kazakhstan (Nur-Sultan), 2020, 8 (1), pp.44-61. We study the simplest explicit formulas for approximate finding the complex scattering amplitude from modulus of the scattering wave function. We obtain detailed error estimates for these formulas in dimensions d = 3 and d = 2.
• Hölder-logarithmic stability in Fourier synthesis
  
  • Isaev Mikhail
  • Novikov Roman G
  Inverse Problems, IOP Publishing, 2020, 36 (12), pp.125003(17 pp.). We prove a Hölder-logarithmic stability estimate for the problem of finding a sufficiently regular compactly supported function v on R^d from its Fourier transform Fv given on [−r, r]^d. This estimate relies on a Hölder stable continuation of Fv from [−r, r]^d to a larger domain. The related reconstruction procedures are based on truncated series of Chebyshev polynomials. We also give an explicit example showing optimality of our stability estimates. (10.1088/1361-6420/abb5df)
  DOI : 10.1088/1361-6420/abb5df
• SCALPEL3: a scalable open-source library for healthcare claims databases
  
  • Bacry Emmanuel
  • Gaiffas Stéphane
  • Leroy Fanny
  • Morel Maryan
  • Nguyen D.P.
  • Sebiat Youcef
  • Sun Dian
  International Journal of Medical Informatics, Elsevier, 2020.
• Variance Reduction Methods and Multilevel Monte Carlo Strategy for Estimating Densities of Solutions to Random Second-Order Linear Differential Equations
  
  • Jornet Marc
  • Calatayud Julia
  • Le Maitre Olivier
  • Cortés Juan Carlos
  International Journal for Uncertainty Quantification, Begell House Publishers, 2020, 10 (5), pp.467-497. This paper concerns the estimation of the density function of the solution to a random nonautonomous second-order linear differential equation with analytic data processes. In a recent contribution, we proposed to express the density function as an expectation, and we used a standard Monte Carlo algorithm to approximate the expectation. Although the algorithms worked satisfactorily for most test problems, some numerical challenges emerged for others, due to large statistical errors. In these situations, the convergence of the Monte Carlo simulation slows down severely, and noisy features plague the estimates. In this paper, we focus on computational aspects and propose several variance reduction methods to remedy these issues and speed up the convergence. First, we introduce a pathwise selection of the approximating processes which aims at controlling the variance of the estimator. Second, we propose a hybrid method, combining Monte Carlo and deterministic quadrature rules, to estimate the expectation. Third, we exploit the series expansions of the solutions to design a multilevel Monte Carlo estimator. The proposed methods are implemented and tested on several numerical examples to highlight the theoretical discussions and demonstrate the significant improvements achieved.
• Ergodic behavior of non-conservative semigroups via generalized Doeblin's conditions
  
  • Bansaye Vincent
  • Cloez Bertrand
  • Gabriel Pierre
  Acta Applicandae Mathematicae, Springer Verlag, 2020, 166 (1), pp.29-72. We provide quantitative estimates in total variation distance for positive semi-groups, which can be non-conservative and non-homogeneous. The techniques relies on a family of conservative semigroups that describes a typical particle and Doeblin's type conditions for coupling the associated process. Our aim is to provide quantitative estimates for linear partial differential equations and we develop several applications for population dynamics in varying environment. We start with the asymptotic profile for a growth diffusion model with time and space non-homogeneity. Moreover we provide general estimates for semigroups which become asymptotically homogeneous, which are applied to an age-structured population model. Finally, we obtain a speed of convergence for periodic semi-groups and new bounds in the homogeneous setting. They are are illustrated on the renewal equation. (10.1007/s10440-019-00253-5)
  DOI : 10.1007/s10440-019-00253-5
• An Eco-Routing Algorithm for HEVs Under Traffic Conditions
  
  • Rhun Arthur Le
  • Bonnans Frédéric
  • Nunzio Giovanni De
  • Leroy Thomas
  • Martinon Pierre
  IFAC-PapersOnLine, Elsevier, 2020, 53 (2), pp.14242 - 14247. In a previous work, a bi-level optimization approach was presented for the energy management of Hybrid Electric Vehicles (HEVs), using a statistical model for traffic conditions. The present work is an extension of this framework to the eco-routing problem. The optimal trajectory is computed as the shortest path on a weighted graph whose nodes are (position, state of charge) pairs for the vehicle. The edge costs are provided by cost maps from an offline optimization at the lower level of small road segments. The error due to the discretization of the state of charge is proven to be linear if the cost maps are Lipschitz. The classical A * algorithm is used to solve the problem, with a heuristic based on a lower bound of the energy needed to complete the travel. The eco-routing method is compared to the fastest-path strategy by numerical simulations on a simple synthetic road network. (10.1016/j.ifacol.2020.12.1158)
  DOI : 10.1016/j.ifacol.2020.12.1158
• Quality Gain Analysis of the Weighted Recombination Evolution Strategy on General Convex Quadratic Functions
  
  • Akimoto Youhei
  • Auger Anne
  • Hansen Nikolaus
  Theoretical Computer Science, Elsevier, 2020, 832, pp.42-67. Quality gain is the expected relative improvement of the function value in a single step of a search algorithm. Quality gain analysis reveals the dependencies of the quality gain on the parameters of a search algorithm, based on which one can derive the optimal values for the parameters. In this paper, we investigate evolution strategies with weighted recombination on general convex quadratic functions. We derive a bound for the quality gain and two limit expressions of the quality gain. From the limit expressions, we derive the optimal recombination weights and the optimal step-size, and find that the optimal recombination weights are independent of the Hessian of the objective function. Moreover, the dependencies of the optimal parameters on the dimension and the population size are revealed. Differently from previous works where the population size is implicitly assumed to be smaller than the dimension, our results cover the population size proportional to or greater than the dimension. Simulation results show the optimal parameters derived in the limit approximates the optimal values in non-asymptotic scenarios. (10.1016/j.tcs.2018.05.015)
  DOI : 10.1016/j.tcs.2018.05.015
• On Invariance and Linear Convergence of Evolution Strategies with Augmented Lagrangian Constraint Handling
  
  • Atamna Asma
  • Auger Anne
  • Hansen Nikolaus
  Theoretical Computer Science, Elsevier, 2020, 832, pp.68-97. In the context of numerical constrained optimization, we investigate stochastic algorithms, in particular evolution strategies, handling constraints via augmented Lagrangian approaches. In those approaches, the original constrained problem is turned into an unconstrained one and the function optimized is an augmented Lagrangian whose parameters are adapted during the optimization. The use of an augmented Lagrangian however breaks a central invariance property of evolution strategies, namely invariance to strictly increasing transformations of the objective function. We formalize nevertheless that an evolution strategy with augmented Lagrangian constraint handling should preserve invariance to strictly increasing affine transformations of the objective function and the scaling of the constraints—a subclass of strictly increasing transformations. We show that this invariance property is important for the linear convergence of these algorithms and show how both properties are connected. (10.1016/j.tcs.2018.10.006)
  DOI : 10.1016/j.tcs.2018.10.006
• Multiscale population dynamics in reproductive biology: singular perturbation reduction in deterministic and stochastic models
  
  • Bonnet Celine
  • Chahour Keltoum
  • Clément Frédérique
  • Postel Marie
  • Yvinec Romain
  ESAIM: Proceedings and Surveys, EDP Sciences, 2020, 67, pp.72-99. In this study, we describe different modeling approaches for ovarian follicle population dynamics, based on either ordinary (ODE), partial (PDE) or stochastic (SDE) differential equations, and accounting for interactions between follicles. We put a special focus on representing the populationlevel feedback exerted by growing ovarian follicles onto the activation of quiescent follicles. We take advantage of the timescale difference existing between the growth and activation processes to apply model reduction techniques in the framework of singular perturbations. We first study the linear versions of the models to derive theoretical results on the convergence to the limit models. In the nonlinear cases, we provide detailed numerical evidence of convergence to the limit behavior. We reproduce the main semi-quantitative features characterizing the ovarian follicle pool, namely a bimodal distribution of the whole population, and a slope break in the decay of the quiescent pool with aging. (10.1051/proc/202067006)
  DOI : 10.1051/proc/202067006
• Variance reduction for Markov chains with application to MCMC
  
  • Belomestny D
  • Iosipoi L
  • Moulines E
  • Naumov A
  • Samsonov S
  Statistics and Computing, Springer Verlag (Germany), 2020. In this paper we propose a novel variance reduction approach for additive functionals of Markov chains based on minimization of an estimate for the asymptotic variance of these functionals over suitable classes of control variates. A distinctive feature of the proposed approach is its ability to significantly reduce the overall finite sample variance. This feature is theoretically demonstrated by means of a deep non asymptotic analysis of a variance reduced functional as well as by a thorough simulation study. In particular we apply our method to various MCMC Bayesian estimation problems where it favourably compares to the existing variance reduction approaches.
• A new McKean-Vlasov stochastic interpretation of the parabolic-parabolic Keller-Segel model: The one-dimensional case
  
  • Tomasevic Milica
  • Talay Denis
  Bernoulli, Bernoulli Society for Mathematical Statistics and Probability, 2020, 26 (2), pp.1323-1353. In this paper we analyze a stochastic interpretation of the one-dimensional parabolic-parabolic Keller-Segel system without cut-off. It involves an original type of McKean-Vlasov interaction kernel. At the particle level, each particle interacts with all the past of each other particle by means of a time integrated functional involving a singular kernel. At the mean-field level studied here, the McKean-Vlasov limit process interacts with all the past time marginals of its probability distribution in a similarly singular way. We prove that the parabolic-parabolic Keller-Segel system in the whole Euclidean space and the corresponding McKean-Vlasov stochastic differential equation are well-posed for any values of the parameters of the model. (10.3150/19-BEJ1158)
  DOI : 10.3150/19-BEJ1158
• The boundary of random planar maps via looptrees
  
  • Kortchemski Igor
  • Richier Loïc
  Annales de la Faculté des Sciences de Toulouse. Mathématiques., Université Paul Sabatier _ Cellule Mathdoc, 2020, 29 (2), pp.391-430. (10.5802/afst.1636)
  DOI : 10.5802/afst.1636
• Accuracy assessment of the Non-Ideal Computational Fluid Dynamics model for siloxane MDM from the open-source SU2 suite
  
  • Gori Giulio
  • Zocca Marta
  • Cammi Giorgia
  • Spinelli Andrea
  • Congedo Pietro Marco
  • Guardone Alberto
  European Journal of Mechanics - B/Fluids, Elsevier, 2020, 79, pp.109-120. The first-ever accuracy assessment of a computational model for Non-Ideal Compressible-Fluid Dynamics (NICFD) flows is presented. The assessment relies on a comparison between numerical predictions, from the open-source suite SU2, and pressure and Mach number measurements of compressible fluid flows in the non-ideal regime. Namely, measurements regard supersonic flows of siloxane MDM (Octamethyltrisiloxane, C 8 H 24 O 2 Si 3) vapor expanding along isentropes in the close proximity of the liquid-vapor saturation curve. The model accuracy assessment takes advantage of an Uncertainty Quantification (UQ) analysis, to compute the variability of the numerical solution with respect the uncertainties affecting the test-rig operating conditions. This allows for an uncertainty-based assessment of the accuracy of numerical predictions. The test set is representative of typical operating conditions of Organic Rankine Cycle systems and it includes compressible flows expanding through a converging-diverging nozzle in mildly-to-highly non-ideal conditions. All the considered flows are well represented by the computational model. Therefore, the reliability of the numerical implementation and the predictiveness of the NICFD model are confirmed. (10.1016/j.euromechflu.2019.08.014)
  DOI : 10.1016/j.euromechflu.2019.08.014
• Parametric inference for diffusions observed at stopping times
  
  • Gobet Emmanuel
  • Stazhynski Uladzislau
  Electronic Journal of Statistics, Shaker Heights, OH : Institute of Mathematical Statistics, 2020, 14 (1). In this paper we study the problem of parametric inference for multidimensional diffusions based on observations at random stopping times. We work in the asymptotic framework of high frequency data over a fixed horizon. Previous works on the subject (such as [Doh87, GJ93, Gob01, AM04] among others) consider only deterministic, strongly predictable or random, independent of the process, observation times, and do not cover our setting. Under mild assumptions we construct a consistent sequence of estimators, for a large class of stopping time observation grids (studied in [GL14, GS18]). Further we carry out the asymptotic analysis of the estimation error and establish a Central Limit Theorem (CLT) with a mixed Gaussian limit. In addition, in the case of a 1-dimensional parameter, for any sequence of estimators verifying CLT conditions without bias, we prove a uniform a.s. lower bound on the asymptotic variance, and show that this bound is sharp. (10.1214/20-EJS1708)
  DOI : 10.1214/20-EJS1708
• On the Turnpike Property and the Receding-Horizon Method for Linear-Quadratic Optimal Control Problems
  
  • Breiten Tobias
  • Pfeiffer Laurent
  SIAM Journal on Control and Optimization, Society for Industrial and Applied Mathematics, 2020, 58 (2), pp.26. Optimal control problems with a very large time horizon can be tackled with the Receding Horizon Control (RHC) method, which consists in solving a sequence of optimal control problems with small prediction horizon. The main result of this article is the proof of the exponential convergence (with respect to the prediction horizon) of the control generated by the RHC method towards the exact solution of the problem. The result is established for a class of infinite-dimensional linear-quadratic optimal control problems with time-independent dynamics and integral cost. Such problems satisfy the turnpike property: the optimal trajectory remains most of the time very close to the solution to the associated static optimization problem. Specific terminal cost functions, derived from the Lagrange multiplier associated with the static optimization problem, are employed in the implementation of the RHC method. (10.1137/18M1225811)
  DOI : 10.1137/18M1225811
• Multimode communication through the turbulent atmosphere
  
  • Borcea Liliana
  • Garnier Josselin
  • Sølna Knut
  Journal of the Optical Society of America. A Optics, Image Science, and Vision, Optical Society of America, 2020, 37 (5), pp.720. A central question in free-space optical communications is how to improve the transfer of information between a transmitter and a receiver. The capacity of the communication channel can be increased by multiplexing of independent modes using either: (1) the multiple-input–multiple-output (MIMO) approach, where communication is done with modes obtained from the singular value decomposition of the transfer matrix from the transmitter array to the receiver array, or (2) the orbital angular momentum (OAM) approach, which uses vortex beams that carry angular momenta. In both cases, the number of usable modes is limited by the finite aperture of the transmitter and receiver, and the effect of the turbulent atmosphere. The goal of this paper is twofold: first, we show that the MIMO and OAM multiplexing schemes are closely related. Specifically, in the case of circular apertures, the leading singular vectors of the transfer matrix, which are useful for communication, are essentially the same as the commonly used Laguerre–Gauss vortex beams, provided these have a special radius that depends on the wavelength, the distance from the transmitter to the receiver, and the ratio of the radii of their apertures. Second, we characterize the effect of atmospheric turbulence on the communication modes using the phase screen method put in the mathematical framework of beam propagation in random media. (10.1364/JOSAA.384007)
  DOI : 10.1364/JOSAA.384007
• A game theory approach to the existence and uniqueness of nonlinear Perron-Frobenius eigenvectors
  
  • Akian Marianne
  • Gaubert Stéphane
  • Hochart Antoine
  Discrete and Continuous Dynamical Systems - Series A, American Institute of Mathematical Sciences, 2020, 40, pp.207--231. We establish a generalized Perron-Frobenius theorem, based on a combinatorial criterion which entails the existence of an eigenvector for any nonlinear order-preserving and positively homogeneous map $f$ acting on the open orthant $\mathbb{R}_{\scriptscriptstyle >0}^n$. This criterion involves dominions, i.e., sets of states that can be made invariant by one player in a two-person game that only depends on the behavior of $f$ "at infinity". In this way, we characterize the situation in which for all $\alpha, \beta > 0$, the "slice space" $\mathcal{S}_\alpha^\beta := \{ x \in \mathbb{R}_{\scriptscriptstyle >0}^n \mid \alpha x \leq f(x) \leq \beta x \}$ is bounded in Hilbert's projective metric, or, equivalently, for all uniform perturbations $g$ of $f$, all the orbits of $g$ are bounded in Hilbert's projective metric. This solves a problem raised by Gaubert and Gunawardena (Trans. AMS, 2004). We also show that the uniqueness of an eigenvector is characterized by a dominion condition, involving a different game depending now on the local behavior of $f$ near an eigenvector. We show that the dominion conditions can be verified by directed hypergraph methods. We finally illustrate these results by considering specific classes of nonlinear maps, including Shapley operators, generalized means and nonnegative tensors. (10.3934/dcds.2020009)
  DOI : 10.3934/dcds.2020009
• Surface waves in a channel with thin tunnels and wells at the bottom: non-reflecting underwater tomography
  
  • Chesnel Lucas
  • Nazarov Sergei
  • Taskinen Jari
  Asymptotic Analysis, IOS Press, 2020. We consider the propagation of surface water waves in a straight planar channel perturbed at the bottom by several thin curved tunnels and wells. We propose a method to construct non reflecting underwater topographies of this type at an arbitrary prescribed wave number. To proceed, we compute asymptotic expansions of the diffraction solutions with respect to the small parameter of the geometry taking into account the existence of boundary layer phenomena. We establish error estimates to validate the expansions using advances techniques of weighted spaces with detached asymptotics. In the process, we show the absence of trapped surface waves for perturbations small enough. This analysis furnishes asymptotic formulas for the scattering matrix and we use them to determine underwater topographies which are non-reflecting. Theoretical and numerical examples are given.
• A convergent hierarchy of non-linear eigenproblems to compute the joint spectral radius of nonnegative matrices
  
  • Gaubert Stéphane
  • Stott Nikolas
  Mathematical Control and Related Fields, AIMS, 2020, 10 (3), pp.573-590. We show that the joint spectral radius of a finite collection of nonnegative matrices can be bounded by the eigenvalue of a non-linear operator. This eigenvalue coincides with the ergodic constant of a risk-sensitive control problem, or of an entropy game, in which the state space consists of all switching sequences of a given length. We show that, by increasing this length, we arrive at a convergent approximation scheme to compute the joint spectral radius. The complexity of this method is exponential in the length of the switching sequences, but it is quite insensitive to the size of the matrices, allowing us to solve very large scale instances (several matrices in dimensions of order 1000 within a minute). An idea of this method is to replace a hierarchy of optimization problems, introduced by Ahmadi, Jungers, Parrilo and Roozbehani, by a hierarchy of nonlinear eigenproblems. To solve the latter eigenproblems, we introduce a projective version of Krasnoselskii-Mann iteration. This method is of independent interest as it applies more generally to the nonlinear eigenproblem for a monotone positively homogeneous map. Here, this method allows for scalability by avoiding the recourse to linear or semidefinite programming techniques. (10.3934/mcrf.2020011)
  DOI : 10.3934/mcrf.2020011
• Multipoint formulas for scattered far field in multidimensions
  
  • Novikov Roman
  Inverse Problems, IOP Publishing, 2020, 36 (9), pp.095001(12 pp.). We give asymptotic formulas for finding the scattering amplitude at fixed frequency and angles (scattered far field) from the scattering wave function given at $n$ points in dimension $d\geq 2$. These formulas are explicit and their precision is proportional to $n$. To our knowledge these formulas are new already for $n\geq 2$. (10.1088/1361-6420/aba891)
  DOI : 10.1088/1361-6420/aba891
• A metric interpretation of the geodesic curvature in the Heisenberg group
  
  • Kohli Mathieu
  Journal of Dynamical and Control Systems, Springer Verlag, 2020, 26 (1), pp.159–174. In this paper we study the notion of geodesic curvature of smooth horizontal curves parametrized by arc lenght in the Heisenberg group, that is the simplest sub-Riemannian structure. Our goal is to give a metric interpretation of this notion of geodesic curvature as the first corrective term in the Taylor expansion of the distance between two close points of the curve. (10.1007/s10883-019-09444-7)
  DOI : 10.1007/s10883-019-09444-7
• Uncertainty Quantification for Stochastic Approximation Limits Using Chaos Expansion
  
  • Crépey Stéphane
  • Fort Gersende
  • Gobet Emmanuel
  • Stazhynski Uladzislau
  SIAM/ASA Journal on Uncertainty Quantification, ASA, American Statistical Association, 2020, 8 (3), pp.1061–1089. The uncertainty quantification for the limit of a Stochastic Approximation (SA) algorithm is analyzed. In our setup, this limit $f^*$ is defined as a zero of an intractable function and is modeled as uncertain through a parameter $\theta$. We aim at deriving the function $f^*$, as well as the probabilistic distribution of $f^*(\theta)$ given a probability distribution $\pi$ for $\theta$. We introduce the so-called Uncertainty Quantification for SA (UQSA) algorithm, an SA algorithm in increasing dimension for computing the basis coefficients of a chaos expansion of $\theta \mapsto f^*(\theta)$ on an orthogonal basis of a suitable Hilbert space. UQSA, run with a finite number of iterations $K$, returns a finite set of coefficients, providing an approximation $\widehat{f^*_K}(\cdot)$ of $f^*$. We establish the almost-sure and $L^p$-convergences in the Hilbert space of the sequence of functions $\widehat{f^*_K}(\cdot)$ when the number of iterations $K$ tends to infinity. This is done under mild, tractable conditions, uncovered by the existing literature for convergence analysis of infinite dimensional SA algorithms. For a suitable choice of the Hilbert basis, the algorithm also provides an approximation of the expectation, of the variance-covariance matrix and of higher order moments of the quantity $\widehat{f^*_K}(\theta)$ when $\theta$ is random with distribution $\pi$. UQSA is illustrated and the role of its design parameters is discussed numerically. (10.1137/18M1178517)
  DOI : 10.1137/18M1178517
• Approximate and exact controllability of linear difference equations
  
  • Chitour Yacine
  • Mazanti Guilherme
  • Sigalotti Mario
  Journal de l'École polytechnique — Mathématiques, École polytechnique, 2020, 7, pp.93--142. In this paper, we study approximate and exact controllability of the linear difference equation $x(t) = \sum_{j=1}^N A_j x(t - \Lambda_j) + B u(t)$ in $L^2$, with $x(t) \in \mathbb C^d$ and $u(t) \in \mathbb C^m$, using as a basic tool a representation formula for its solution in terms of the initial condition, the control $u$, and some suitable matrix coefficients. When $\Lambda_1, \dotsc, \Lambda_N$ are commensurable, approximate and exact controllability are equivalent and can be characterized by a Kalman criterion. This paper focuses on providing characterizations of approximate and exact controllability without the commensurability assumption. In the case of two-dimensional systems with two delays, we obtain an explicit characterization of approximate and exact controllability in terms of the parameters of the problem. In the general setting, we prove that approximate controllability from zero to constant states is equivalent to approximate controllability in $L^2$. The corresponding result for exact controllability is true at least for two-dimensional systems with two delays. (10.5802/jep.112)
  DOI : 10.5802/jep.112
• How a moving passive observer can perceive its environment ? The Unruh effect revisited
  
  • Fink Mathias
  • Garnier Josselin
  Wave Motion, Elsevier, 2020, 93, pp.102462. (10.1016/j.wavemoti.2019.102462)
  DOI : 10.1016/j.wavemoti.2019.102462