scholarly journals Correction to “Planning With Learned Dynamics: Probabilistic Guarantees on Safety and Reachability Via Lipschitz Constants”

2022 ◽  
Vol 7 (1) ◽  
pp. 381-381
Author(s):  
Craig Knuth ◽  
Glen Chou ◽  
Necmiye Ozay ◽  
Dmitry Berenson
Keyword(s):  
2018 ◽  
Vol 24 (4) ◽  
pp. 225-247 ◽  
Author(s):  
Xavier Warin

Abstract A new method based on nesting Monte Carlo is developed to solve high-dimensional semi-linear PDEs. Depending on the type of non-linearity, different schemes are proposed and theoretically studied: variance error are given and it is shown that the bias of the schemes can be controlled. The limitation of the method is that the maturity or the Lipschitz constants of the non-linearity should not be too high in order to avoid an explosion of the computational time. Many numerical results are given in high dimension for cases where analytical solutions are available or where some solutions can be computed by deep-learning methods.


Foundations ◽  
2022 ◽  
Vol 2 (1) ◽  
pp. 114-127
Author(s):  
Samundra Regmi ◽  
Christopher I. Argyros ◽  
Ioannis K. Argyros ◽  
Santhosh George

The celebrated Traub’s method involving Banach space-defined operators is extended. The main feature in this study involves the determination of a subset of the original domain that also contains the Traub iterates. In the smaller domain, the Lipschitz constants are smaller too. Hence, a finer analysis is developed without the usage of additional conditions. This methodology applies to other methods. The examples justify the theoretical results.


2008 ◽  
Vol 18 (08) ◽  
pp. 2425-2435 ◽  
Author(s):  
SAMUEL BOWONG ◽  
RENÉ YAMAPI

This study addresses the adaptive synchronization of a class of uncertain chaotic systems in the drive-response framework. For a class of uncertain chaotic systems with parameter mismatch and external disturbances, a robust adaptive observer based on the response system is constructed to practically synchronize the uncertain drive chaotic system. Lyapunov stability theory ensures the practical synchronization between the drive and response systems even if Lipschitz constants on function matrices and bounds on uncertainties are unknown. Numerical simulation of two illustrative examples are given to verify the effectiveness of the proposed method.


Author(s):  
Sergey Smirnov

The article discusses a modern approach to risk management of the central counterparty,primarily the issue of the sufficiency of its financial resources, including the provision of clearingmembers, the capital of the central counterparty and the mutual liability fund. The main subject is the margining system, responsible for an adequate level of collateral for clearing members, that plays critical role in risk management, being the vanguard in protecting against losses associated with default by clearing members and the most sensitive to market risk part of the central counterparty’s skin of the game. A system of margining a portfolio of options and futures in the derivatives market is described, with default management based on the methodology proposed by a number of inventors, registered in 2004. For this system, a mathematical model of margining (i.e. determining the required level of the collateral) is built, based on the ideology of a guaranteed deterministic approach to superhedging: Bellman–Isaacs equations are derived from the economic meaning of the problem. A form of these equations, convenient for calculations, is obtained. Lipschitz constants for the solutions of Bellman–Isaacs equations are estimated. A computational framework for efficient numerical solution of these equations is created. Numerical experiments are carried out on some model examples to demonstrate the efficiency of the system. These experiments also show practical implications of marginsubadditivity — a crucial property of the mathematical model.


Mathematics ◽  
2019 ◽  
Vol 7 (8) ◽  
pp. 708 ◽  
Author(s):  
Suthep Suantai ◽  
Suparat Kesornprom ◽  
Prasit Cholamjiak

We investigate the split variational inclusion problem in Hilbert spaces. We propose efficient algorithms in which, in each iteration, the stepsize is chosen self-adaptive, and proves weak and strong convergence theorems. We provide numerical experiments to validate the theoretical results for solving the split variational inclusion problem as well as the comparison to algorithms defined by Byrne et al. and Chuang, respectively. It is shown that the proposed algorithms outrun other algorithms via numerical experiments. As applications, we apply our method to compressed sensing in signal recovery. The proposed methods have as a main advantage that the computation of the Lipschitz constants for the gradient of functions is dropped in generating the sequences.


Mathematics ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 179
Author(s):  
Ramandeep Behl ◽  
Ioannis K. Argyros

Our aim in this article is to suggest an extended local convergence study for a class of multi-step solvers for nonlinear equations valued in a Banach space. In comparison to previous studies, where they adopt hypotheses up to 7th Fŕechet-derivative, we restrict the hypotheses to only first-order derivative of considered operators and Lipschitz constants. Hence, we enlarge the suitability region of these solvers along with computable radii of convergence. In the end of this study, we choose a variety of numerical problems which illustrate that our works are applicable but not earlier to solve nonlinear problems.


Sign in / Sign up

Export Citation Format

Share Document