Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userG{^a}teaux type path-dependent PDEs and BSDEs with Gaussian forward processes
362
0
0.0
(
0
)
Authors
Adrien Barrasso
Ask ChatGPT about the research
No Arabic abstract
We are interested in path-dependent semilinear PDEs, where the derivatives are of G{^a}teaux type in specific directions k and b, being the kernel functions of a Volterra Gaussian process X. Under some conditions on k, b and the coefficients of the PDE, we prove existence and uniqueness of a decoupled mild solution, a notion introduced in a previous paper by the authors. We also show that the solution of the PDE can be represented through BSDEs where the forward (underlying) process is X.
rate research
Read More
In this paper, we study the well-posedness of multi-dimensional backward stochastic differential equations driven by $G$-Brownian motion ($G$-BSDEs) with diagonal generators, the $z$ parts of whose $l$-th components only depend on the $l$-th columns. The existence and uniqueness of solutions are obtained via a contraction argument for $Y$ component and a backward iteration of local solutions. Furthermore, we show that, the solution of multi-dimensional $G$-BSDE in a Markovian framework provides a probabilistic formula for the viscosity solution of a system of nonlinear parabolic partial differential equations.
We introduce and solve a new type of quadratic backward stochastic differential equation systems defined in an infinite time horizon, called emph{ergodic BSDE systems}. Such systems arise naturally as candidate solutions to characterize forward performance processes and their associated optimal trading strategies in a regime switching market. In addition, we develop a connection between the solution of the ergodic BSDE system and the long-term growth rate of classical utility maximization problems, and use the ergodic BSDE system to study the large time behavior of PDE systems with quadratic growth Hamiltonians.
The paper analyzes risk assessment for cash flows in continuous time using the notion of convex risk measures for processes. By combining a decomposition result for optional measures, and a dual representation of a convex risk measure for bounded cd processes, we show that this framework provides a systematic approach to the both issues of model ambiguity, and uncertainty about the time value of money. We also establish a link between risk measures for processes and BSDEs.
In this paper, we first study one-dimensional quadratic backward stochastic differential equations driven by $G$-Brownian motions ($G$-BSDEs) with unbounded terminal values. With the help of a $theta$-method of Briand and Hu [4] and nonlinear stochastic analysis techniques, we propose an approximation procedure to prove existence and uniqueness result when the generator is convex (or concave) and terminal value is of exponential moments of arbitrary order. Finally, we also establish the well-posedness of multi-dimensional G-BSDEs with diagonally quadratic generators.
We introduce a simple, rigorous, and unified framework for solving nonlinear partial differential equations (PDEs), and for solving inverse problems (IPs) involving the identification of parameters in PDEs, using the framework of Gaussian processes. The proposed approach: (1) provides a natural generalization of collocation kernel methods to nonlinear PDEs and IPs; (2) has guaranteed convergence for a very general class of PDEs, and comes equipped with a path to compute error bounds for specific PDE approximations; (3) inherits the state-of-the-art computational complexity of linear solvers for dense kernel matrices. The main idea of our method is to approximate the solution of a given PDE as the maximum a posteriori (MAP) estimator of a Gaussian process conditioned on solving the PDE at a finite number of collocation points. Although this optimization problem is infinite-dimensional, it can be reduced to a finite-dimensional one by introducing additional variables corresponding to the values of the derivatives of the solution at collocation points; this generalizes the representer theorem arising in Gaussian process regression. The reduced optimization problem has the form of a quadratic objective function subject to nonlinear constraints; it is solved with a variant of the Gauss--Newton method. The resulting algorithm (a) can be interpreted as solving successive linearizations of the nonlinear PDE, and (b) in practice is found to converge in a small number of iterations (2 to 10), for a wide range of PDEs. Most traditional approaches to IPs interleave parameter updates with numerical solution of the PDE; our algorithm solves for both parameter and PDE solution simultaneously. Experiments on nonlinear elliptic PDEs, Burgers equation, a regularized Eikonal equation, and an IP for permeability identification in Darcy flow illustrate the efficacy and scope of our framework.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
