Related papers: Bounding averages rigorously using semidefinite pr…
Polyak-Ruppert averaging is a widely used technique to achieve the optimal asymptotic variance of stochastic approximation (SA) algorithms, yet its high-probability performance guarantees remain underexplored in general settings. In this…
The stability of classical semi-implicit scheme, and some more advanced iterative schemes recently proposed for Numerical Weather Prediction (NWP) purpose is examined. In all these schemes, the solution of the centred-implicit non-linear…
This paper generalizes a previously-conceived, continuation-based optimization technique for scalar objective functions on constraint manifolds to cases of periodic and quasiperiodic solutions of delay-differential equations. A Lagrange…
In this work, we analyze the finite element method with arbitrary but fixed polynomial degree for the nonlinear Helmholtz equation with impedance boundary conditions. We show well-posedness and error estimates of the finite element solution…
Time bounded reachability is a fundamental problem in model checking continuous-time Markov chains (CTMCs) and Markov decision processes (CTMDPs) for specifications in continuous stochastic logics. It can be computed by numerically solving…
In this work we study the averaging principle for non-autonomous slow-fast systems of stochastic differential equations. In particular in the first part we prove the averaging principle assuming the sublinearity, the Lipschitzianity and the…
We establish bounds for the covariance of a large class of functions of infinite variance stable random variables, including unbounded functions such as the power function and the logarithm. These bounds involve measures of dependence…
Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…
We study monotone P1 finite element methods on unstructured meshes for fully non-linear, degenerately parabolic Isaacs equations with isotropic diffusions arising from stochastic game theory and optimal control and show uniform convergence…
We present a novel method to compute unstable periodic orbits (UPOs) that optimize the infinite-time average of a given quantity for polynomial ODE systems. The UPO search procedure relies on polynomial optimization to construct nonnegative…
Linear nonautonomous/random parabolic partial differential equations are considered under the Dirichlet, Neumann or Robin boundary conditions, where both the zero order coefficients in the equation and the coefficients in the boundary…
The peridynamic theory brings advantages in dealing with discontinuities, dynamic loading, and non-locality. The integro-differential formulation of peridynamics poses challenges to numerical solutions of complicated and practical problems.…
We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…
A novel data-driven method for formal verification is proposed to study complex systems operating in safety-critical domains. The proposed approach is able to formally verify discrete-time stochastic dynamical systems against temporal logic…
The standard phase-ordering process is obtained by quenching a system, like the Ising model, to below the critical point. This is usually done with periodic boundary conditions to insure ergodicity breaking in the low temperature phase.…
We present an accelerated, or 'look-ahead' version of the Newton-Dinkelbach method, a well-known technique for solving fractional and parametric optimization problems. This acceleration halves the Bregman divergence between the current…
In this paper, we investigate the robustness to external disturbances of switched discrete and continuous systems with multiple equilibria. It is shown that if each subsystem of the switched system is Input-to-State Stable (ISS), then under…
We propose a high-order finite element method for linear fourth-order elliptic problems that is both nodally bound-preserving and mass-conservative, based on a variational inequality formulation. The method admits an equivalent strictly…
Semidefinite programming (SDP) is a fundamental class of convex optimization problems with diverse applications in mathematics, engineering, machine learning, and related disciplines. This paper investigates the application of the…
We describe a nonlinear generalization of dual dynamic programming theory and its application to value function estimation for deterministic control problems over continuous state and action spaces, in a discrete-time infinite horizon…