Related papers: Near-optimal approximation methods for elliptic PD…
A family of interior penalty $hp$-discontinuous Galerkin methods is developed and analyzed for the numerical solution of the quasilinear elliptic equation $-\nabla{} \cdot (\mathbf{A}(\nabla{u}) \nabla{u} = f$ posed on the open bounded…
We study fully discrete linearized Galerkin finite element approximations to a nonlinear gradient flow, applications of which can be found in many areas. Due to the strong nonlinearity of the equation, existing analyses for implicit schemes…
In this paper we analyze a zeroth-order proximal stochastic gradient method suitable for the minimization of weakly convex stochastic optimization problems. We consider nonsmooth and nonlinear stochastic composite problems, for which…
We consider variants of trust-region and cubic regularization methods for non-convex optimization, in which the Hessian matrix is approximated. Under mild conditions on the inexact Hessian, and using approximate solution of the…
Elliptic bases, introduced by Couveignes and Lercier in 2009, give an elegant way of representing finite field extensions. A natural question which seems to have been considered independently by several groups is to use this representation…
In this paper, we study least-squares finite element methods (LSFEM) for general second-order elliptic equations with nonconforming finite element approximations. The equation may be indefinite. For the two-field potential-flux div LSFEM…
This paper proposes a stochastic gradient descent method with an adaptive Gaussian noise term for the global minimization of nearly convex functions, which are nonconvex and possess multiple strict local minimizers. The noise term,…
We propose a fast and scalable optimization method to solve chance or probabilistic constrained optimization problems governed by partial differential equations (PDEs) with high-dimensional random parameters. To address the critical…
We present a new approach to approximate nearest-neighbor queries in fixed dimension under a variety of non-Euclidean distances. We are given a set $S$ of $n$ points in $\mathbb{R}^d$, an approximation parameter $\varepsilon > 0$, and a…
In this work, we consider the deterministic optimization using random projections as a statistical estimation problem, where the squared distance between the predictions from the estimator and the true solution is the error metric. In…
This paper presents new results allowing an unknown non-Gaussian positive matrix-valued random field to be identified through a stochastic elliptic boundary value problem, solving a statistical inverse problem. A new general class of…
This paper investigates the Gaussian quasi-likelihood estimation of an exponentially ergodic multidimensional Markov process, which is expressed as a solution to a L\'{e}vy driven stochastic differential equation whose coefficients are…
We consider a general linear parabolic problem with extended time boundary conditions (including initial value problems and periodic ones), and approximate it by the implicit Euler scheme in time and the Gradient Discretisation method in…
We present a new pathwise approximation scheme for stochastic differential equations driven by multidimensional Brownian motion which does not require the simulation of L\'{e}vy area and has a Wasserstein convergence rate better than the…
In this paper, we introduce a quasi-Newton method optimized for efficiently solving quasi-linear elliptic equations and systems, with a specific focus on GPU-based computation. By approximating the Jacobian matrix with a combination of…
In this paper, we discuss the numerical approximation of random periodic solutions (r.p.s.) of stochastic differential equations (SDEs) with multiplicative noise. We prove the existence of the random periodic solution as the limit of the…
In this paper, we propose the approximate Bregman proximal gradient algorithm (ABPG) for solving composite nonconvex optimization problems. ABPG employs a new distance that approximates the Bregman distance, making the subproblem of ABPG…
Trefftz schemes are high-order Galerkin methods whose discrete spaces are made of elementwise exact solutions of the underlying PDE. Trefftz basis functions can be easily computed for many PDEs that are linear, homogeneous, and have…
An elliptic partial differential equation Lu=f with a zero Dirichlet boundary condition is converted to an equivalent elliptic equation on the unit ball. A spectral Galerkin method is applied to the reformulated problem, using multivariate…
In this manuscript, we obtain sharp and improved regularity estimates for weak solutions of weighted quasilinear elliptic models of Hardy-H\'{e}non-type, featuring an explicit regularity exponent depending only on universal parameters. Our…