Related papers: Variational formulation based on duality to solve …
Many physical problems can be modelled by partial differential equations on unknown domains. Several examples can easily be found in the dynamics of free interfaces in fluid dynamics, solid mechanics or in fluid-solid interactions. To solve…
By applying the perturbation function approach, we propose the Lagrangian and the conjugate duals for minimization problems of the sum of two, generally nonconvex, functions. The main tools are the $\Phi$-convexity theory and minimax…
We consider stochastic semi-linear evolution equations which are driven by additive, spatially correlated, Wiener noise, and in particular consider problems of heat equation (analytic semigroup) and damped-driven wave equations (bounded…
In this paper we consider a class of optimization problems with a strongly convex objective function and the feasible set given by an intersection of a simple convex set with a set given by a number of linear equality and inequality…
We extend the Deep Galerkin Method (DGM) introduced in Sirignano and Spiliopoulos (2018)} to solve a number of partial differential equations (PDEs) that arise in the context of optimal stochastic control and mean field games. First, we…
In the context of Discontinuous Galerkin methods, we study approximations of nonlinear variational problems associated with convex energies. We propose element-wise nonconforming finite element methods to discretize the continuous…
We propose a new bundle-based augmented Lagrangian framework for solving constrained convex problems. Unlike the classical (inexact) augmented Lagrangian method (ALM) that has a nested double-loop structure, our framework features a…
In this work, we investigate the large-scale mean-field variational inference (MFVI) problem from a mini-batch primal-dual perspective. By reformulating MFVI as a constrained finite-sum problem, we develop a novel primal-dual algorithm…
The first super-convergent hybridisable discontinuous Galerkin (HDG) method for linear elastic problems capable of using the same degree of approximation for both the primal and mixed variables is presented. The key feature of the method is…
In this paper, we present a numerical scheme to solve the initial-boundary value problem for backward stochastic partial differential equations of parabolic type. Based on the Galerkin method, we approximate the original equation by a…
We propose an unconstrained optimization method based on the well-known primal-dual hybrid gradient (PDHG) algorithm. We first formulate the optimality condition of the unconstrained optimization problem as a saddle point problem. We then…
In this paper we propose a distributed dual gradient algorithm for minimizing linearly constrained separable convex problems and analyze its rate of convergence. In particular, we prove that under the assumption of strong convexity and…
For integrable systems in the sense of multidimensional consistency (MDC) we can consider the Lagrangian as a form, which is closed on solutions of the equations of motion. For 2-dimensional systems, described by partial difference…
In this paper, we use an implicit two-derivative deferred correction time discretization approach and combine it with a spatial discretization of the discontinuous Galerkin spectral element method to solve (non-)linear PDEs. The resulting…
Parametric partial differential equations (PDEs) are fundamental for modeling a wide range of physical and engineering systems influenced by uncertain or varying parameters. Traditional neural network-based solvers, such as Physics-Informed…
Solving initial value problems and boundary value problems of Linear Ordinary Differential Equations (ODEs) plays an important role in many applications. There are various numerical methods and solvers to obtain approximate solutions…
This paper presents symmetry reduction for material stochastic Lagrangian systems with advected quantities whose configuration space is a Lie group. Such variational principles yield deterministic as well as stochastic constrained…
A sparse linear programming (SLP) problem is a linear programming problem equipped with a sparsity (or cardinality) constraint, which is nonconvex and discontinuous theoretically and generally NP-hard computationally due to the…
Discontinuous Galerkin (DG) methods offer an enormous flexibility regarding local grid refinement and variation of polynomial degrees for a variety of different problem classes. With a focus on diffusion problems, we consider DG…
We develop and analyze a local discontinuous Galerkin (LDG) method for solving integral fractional Laplacian problems on bounded Lipschitz domains. The method is based on a three-field mixed formulation involving the primal variable, its…