Related papers: A Viscosity Framework for Dynamic Programming Prin…
Recently, machine learning methods have gained significant traction in scientific computing, particularly for solving Partial Differential Equations (PDEs). However, methods based on deep neural networks (DNNs) often lack convergence…
In this paper we propose a new type of viscosity solutions for fully nonlinear path dependent PDEs. By restricting to certain pseudo Markovian structure, we remove the uniform non- degeneracy condition imposed in our earlier works [9, 10].…
In this paper, the convergence of an algorithm for recovering the unknown kinematic viscosity of a two-dimensional incompressible, viscous fluid is studied. The algorithm of interest is a recursive feedback control-based algorithm that…
A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum…
This paper studies the stochastic optimal control of jump-diffusion processes and the associated fully nonlinear backward stochastic Hamilton--Jacobi--Bellman (BSHJB) equations. We establish the dynamic programming principle (DPP) via…
We introduce a discrete scheme for second order fully nonlinear parabolic PDEs with Caputo's time fractional derivatives. We prove the convergence of the scheme in the framework of the theory of viscosity solutions. The discrete scheme can…
Semi-parametric regression models are used in several applications which require comprehensibility without sacrificing accuracy. Typical examples are spline interpolation in geophysics, or non-linear time series problems, where the system…
In the 2nd version of this note we introduce the notion of viscosity solution for a type of fully nonlinear parabolic path-dependent partial differential equations (P-PDE). We then prove the comparison theorem (or maximum principle) of this…
Partial Differential Equations (PDEs) are fundamental tools for modeling physical phenomena, yet most PDEs of practical interest cannot be solved analytically and require numerical approximations. The feasibility of such numerical methods,…
Semidefinite programming (SDP) is a powerful framework from convex optimization that has striking potential for data science applications. This paper develops a provably correct randomized algorithm for solving large, weakly constrained SDP…
In this paper, we consider approximating the parameter-to-solution maps of parametric partial differential equations (PPDEs) using deep neural networks (DNNs). We propose an efficient approach combining reduced collocation methods (RCMs)…
Dynamic programming (DP) is an algorithmic design paradigm for the efficient, exact solution of otherwise intractable, combinatorial problems. However, DP algorithm design is often presented in an ad-hoc manner. It is sometimes difficult to…
This paper build on our recent work where we presented a dual stochastic optimal control formulation of the nonlinear filtering problem [1]. The constraint for the dual problem is a backward stochastic differential equations (BSDE). The…
We introduce fast randomized algorithms for solving semidefinite programming (SDP) relaxations of the partial permutation synchronization (PPS) problem, a core task in multi-image matching with significant relevance to 3D reconstruction.…
A state-of-the-art deep domain decomposition method (D3M) based on the variational principle is proposed for partial differential equations (PDEs). The solution of PDEs can be formulated as the solution of a constrained optimization…
Dynamic mode decomposition (DMD) represents an effective means for capturing the essential features of numerically or experimentally generated flow fields. In order to achieve a desirable tradeoff between the quality of approximation and…
We extend the proof of the dynamic programming principle (DPP) for standard stochastic optimal control problems driven by general L\'{e}vy noises. Under appropriate assumptions, it is shown that the DPP still holds when the state process…
Density matrix embedding theory (DMET) is a powerful quantum embedding method for solving strongly correlated quantum systems. Theoretically, the performance of a quantum embedding method should be limited by the computational cost of the…
In this paper, we establish a new uniqueness result of a (continuous) viscosity solution for some integro-partial differential equation (IPDE in short). The novelty is that we relax the so-called monotonicity assumption on the driver,…
We analyze an optimal stopping problem with a constraint on the expected cost. When the reward function and cost function are Lipschitz continuous in state variable, we show that the value of such an optimal stopping problem is a continuous…