相关论文: Convergence Rate for the Ordered Upwind Method

We study the numerical approximation of time-dependent, possibly degenerate, second-order Hamilton-Jacobi-Bellman equations in bounded domains with nonhomogeneous Dirichlet boundary conditions. It is well known that convergence towards the…

The proximal bundle method (PBM) is a powerful and widely used approach for minimizing nonsmooth convex functions. However, for smooth objectives, its best-known convergence rate remains suboptimal, and whether PBM can be accelerated…

We consider finite-volume schemes for linear hyperbolic systems with constant coefficients on unstructured meshes. Under the stability assumption, they exhibit the convergence rate between $p$ and $p+1$ where $p$ is the order of the…

The proximal bundle method (PBM) is a fundamental and computationally effective algorithm for solving nonsmooth optimization problems. In this paper, we present the first variant of the PBM for smooth objectives, achieving an accelerated…

We introduce a new class of "filtered" schemes for some first order non-linear Hamilton-Jacobi-Bellman equations. The work follows recent ideas of Froese and Oberman (SIAM J. Numer. Anal., Vol 51, pp.423-444, 2013). The proposed schemes are…

Momentum methods for convex optimization often rely on precise choices of algorithmic parameters, based on knowledge of problem parameters, in order to achieve fast convergence, as well as to prevent oscillations that could severely…

In this paper, we present a fully local second-order upwind scheme, applicable on generic meshes. This is done by hybridisation, which is achieved by introducing unknowns on each edge of the mesh. By doing so, fluxes only depend on values…

We show strong uniform convergence of monotone P1 finite element methods to the viscosity solution of isotropic parabolic Hamilton-Jacobi-Bellman equations with mixed boundary conditions on unstructured meshes and for possibly degenerate…

In this work, we propose a high-order multiscale method for an elliptic model problem with rough and possibly highly oscillatory coefficients. Convergence rates of higher order are obtained using the regularity of the right-hand side only.…

The alternating direction method of multipliers (ADMM) is widely used in solving structured convex optimization problems. Despite of its success in practice, the convergence properties of the standard ADMM for minimizing the sum of $N$…

We study a fully discrete finite element method for variable-order time-fractional diffusion equations with a time-dependent variable order. Optimal convergence estimates are proved with the first-order accuracy in time (and second order…

In this paper, we analyze the local convergence rate of optimistic mirror descent methods in stochastic variational inequalities, a class of optimization problems with important applications to learning theory and machine learning. Our…

This paper is concerned with the optimal convergence rate in homogenization of higher order parabolic systems with bounded measurable, rapidly oscillating periodic coefficients. The sharp $O(\va)$ convergence rate in the space $L^2(0,T;…

We introduce a new numerical method to approximate the solutions of a class of stationary Hamilton-Jacobi (HJ) partial differential equations arising from minimum time optimal control problems. We rely on nested grid approximations, and…

The present paper first aims to study the BV-type regularity for viscosity solutions of the Hamilton-Jacobi equation \[ u_t(t,x)+H\big(D_{x} u(t,x)\big)~=~0\qquad\forall (t,x)\in ]0,\infty[\times\mathbb{R}^d \] with a coercive and uniformly…

In this paper, a class of high order numerical schemes is proposed for solving Hamilton-Jacobi (H-J) equations. This work is regarded as an extension of our previous work for nonlinear degenerate parabolic equations, see Christlieb et al.…

In this paper, we propose an inexact proximal Newton-type method for nonconvex composite problems. We establish the global convergence rate of the order $\mathcal{O}(k^{-1/2})$ in terms of the minimal norm of the KKT residual mapping and…

Nondominated sorting is a discrete process that sorts points in Euclidean space according to the coordinatewise partial order, and is used to rank feasible solutions to multiobjective optimization problems. It was previously shown that…

Computing tasks may often be posed as optimization problems. The objective functions for real-world scenarios are often nonconvex and/or nondifferentiable. State-of-the-art methods for solving these problems typically only guarantee…

We propose an adaptive accelerated smoothing technique for a nonsmooth convex optimization problem where the smoothing update rule is coupled with the momentum parameter. We also extend the setting to the case where the objective function…