Related papers: Superconvergence analysis of partially penalized i…
In this paper, we consider an approximation method, and a novel general analysis, for second-order elliptic differential equations with heterogeneous multiscale coefficients. We obtain convergence of the Generalized Multi-scale Finite…
The inverse conductivity problem aims at determining the unknown conductivity inside a bounded domain from boundary measurements. In practical applications, algorithms based on minimizing a regularized residual functional subject to PDE…
Compared with digital methods, sparse recovery based on spiking neural networks has great advantages like high computational efficiency and low power-consumption. However, current spiking algorithms cannot guarantee more accurate estimates…
In this paper, we propose a novel sparse recovery method based on the generalized error function. The penalty function introduced involves both the shape and the scale parameters, making it very flexible. The theoretical analysis results in…
The subgradient method is one of the most fundamental algorithmic schemes for nonsmooth optimization. The existing complexity and convergence results for this method are mainly derived for Lipschitz continuous objective functions. In this…
This paper considers the finite element solution of the boundary value problem of Poisson's equation and proposes a guaranteed em a posteriori local error estimation based on the hypercircle method. Compared to the existing literature on…
Biased gradient compression with error feedback (EF) reduces communication in federated learning (FL), but under non-IID data, the residual error can decay slowly, causing gradient mismatch and stalled progress in the early rounds. We…
A proof of convergence is given for semi- and full discretizations of mean curvature flow of closed two-dimensional surfaces. The numerical method proposed and studied here combines evolving finite elements, whose nodes determine the…
In the present work, strong approximation errors are analyzed for both the spatial semi-discretization and the spatio-temporal fully discretization of stochastic wave equations (SWEs) with cubic polynomial nonlinearities and additive…
Motivated by penalized likelihood maximization in complex models, we study optimization problems where neither the function to optimize nor its gradient have an explicit expression, but its gradient can be approximated by a Monte Carlo…
We show that standard extragradient methods (i.e. mirror prox and dual extrapolation) recover optimal accelerated rates for first-order minimization of smooth convex functions. To obtain this result we provide a fine-grained…
Bilevel optimization problems are receiving increasing attention in machine learning as they provide a natural framework for hyperparameter optimization and meta-learning. A key step to tackle these problems is the efficient computation of…
We consider the P1/P1 or P1b/P1 finite element approximations to the Stokes equations in a bounded smooth domain subject to the slip boundary condition. A penalty method is applied to address the essential boundary condition $u\cdot n = g$…
The phase field model is a widely used mathematical approach for describing crack propagation in continuum damage fractures. In the context of phase field fracture simulations, adaptive finite element methods (AFEM) are often employed to…
We survey incremental methods for minimizing a sum $\sum_{i=1}^mf_i(x)$ consisting of a large number of convex component functions $f_i$. Our methods consist of iterations applied to single components, and have proved very effective in…
We develop the a posteriori error analysis of finite element approximations of implicit power-law-like models for viscous incompressible fluids. The Cauchy stress and the symmetric part of the velocity gradient in the class of models under…
We design and analyze an adaptive $hp$-finite element method (hp-AFEM) in dimensions $n=1,2$. The algorithm consists of iterating two routines: hp-NEARBEST finds a near-best $hp$-approximation of the current discrete solution and data to a…
We consider the problem of minimizing a convex objective which is the sum of a smooth part, with Lipschitz continuous gradient, and a nonsmooth part. Inspired by various applications, we focus on the case when the nonsmooth part is a…
In this paper, we develop a gradient recovery based linear (GRBL) finite element method (FEM) and a Hessian recovery based linear (HRBL) FEM for second order elliptic equations in non-divergence form. The elliptic equation is casted into a…
We propose new machine learning schemes for solving high dimensional nonlinear partial differential equations (PDEs). Relying on the classical backward stochastic differential equation (BSDE) representation of PDEs, our algorithms estimate…