A Robust Unscented Transformation for Uncertain Moments

02/25/2019
by   Hugo T. M. Kussaba, et al.
0

This paper proposes a robust version of the unscented transform (UT) for one-dimensional random variables. It is assumed that the moments are not exactly known, but are known to lie in intervals. In this scenario, the moment matching equations are reformulated as a system of polynomial equations and inequalities, and it is proposed to use the Chebychev center of the solution set as a robust UT. This method yields a parametrized polynomial optimization problem, which in spite of being NP-Hard, can be relaxed by some algorithms that are proposed in this paper.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/05/2017

Gaussian Process Quadrature Moment Transform

Computation of moments of transformed random variables is a problem appe...
research
05/16/2021

A Realizable Filtered Intrusive Polynomial Moment Method

Intrusive uncertainty quantification methods for hyperbolic problems exh...
research
01/02/2021

New-Type Hoeffding's Inequalities and Application in Tail Bounds

It is well known that Hoeffding's inequality has a lot of applications i...
research
03/23/2020

Moment State Dynamical Systems for Nonlinear Chance-Constrained Motion Planning

Chance-constrained motion planning requires uncertainty in dynamics to b...
research
06/14/2023

Recoverable Robust Optimization with Commitment

We propose a model for recoverable robust optimization with commitment. ...
research
07/14/2021

Non-intrusive polynomial chaos expansion for topology optimization using polygonal meshes

This paper deals with the applications of stochastic spectral methods fo...
research
05/04/2022

Weight distribution of random linear codes and Krawchouk polynomials

For 0 < λ < 1 and n →∞ pick uniformly at random λ n vectors in {0,1}^n a...

Please sign up or login with your details

Forgot password? Click here to reset