相关论文: A superconvergent stencil-adaptive SBP-SAT finite …
This dissertation explores block decomposable methods for large-scale optimization problems. It focuses on alternating direction method of multipliers (ADMM) schemes and block coordinate descent (BCD) methods. Specifically, it introduces a…
This paper introduces a novel approach for the construction of bulk--surface splitting schemes for semi-linear parabolic partial differential equations with dynamic boundary conditions. The proposed construction is based on a reformulation…
We propose a first-order method for stochastic strongly convex optimization that attains $O(1/n)$ rate of convergence, analysis show that the proposed method is simple, easily to implement, and in worst case, asymptotically four times…
In this work, an efficient approximation scheme has been proposed for getting accurate approximate solution of nonlinear partial differential equations with constant or variable coefficients satisfying initial conditions in a series of…
In this paper we investigate explicit numerical approximations for stochastic differential delay equations (SDDEs) under a local Lipschitz condition by employing the adaptive Euler-Maruyama (EM) method. Working in both finite and infinite…
We propose a semidiscrete scheme for approximation of entropy solutions of one-dimensional scalar conservation laws with nonnegative initial data. The scheme is based on the concept of particle paths for conservation laws and can be…
We consider a general asynchronous Stochastic Approximation (SA) scheme featuring a weighted infinity-norm contractive operator, and prove a bound on its finite-time convergence rate on a single trajectory. Additionally, we specialize the…
We investigate the stochastic gradient descent (SGD) method where the step size lies within a banded region instead of being given by a fixed formula. The optimal convergence rate under mild conditions and large initial step size is proved.…
This paper presents a novel stochastic gradient descent algorithm for constrained optimization. The proposed algorithm randomly samples constraints and components of the finite sum objective function and relies on a relaxed logarithmic…
In this paper, we study the convergence rate of the gradient (or steepest descent) method with fixed step lengths for finding a stationary point of an $L$-smooth function. We establish a new convergence rate, and show that the bound may be…
In this paper we propose a new kind of high order numerical scheme for backward stochastic differential equations(BSDEs). Unlike the traditional $\theta$-scheme, we reduce truncation errors by taking $\theta$ carefully for every subinterval…
We introduce an algorithm called SQDP (Stochastic Quadratic Dynamic Programming) to solve some multistage stochastic optimization problems having strongly convex recourse functions. The algorithm extends the classical Stochastic Dual…
We present a detailed convergence analysis for an operator splitting scheme proposed in [C. Liu et al.,J. Comput. Phys., 436, 110253, 2021] for a reaction-diffusion system with detailed balance. The numerical scheme has been constructed…
We study stochastic gradient descent (SGD) and the stochastic heavy ball method (SHB, otherwise known as the momentum method) for the general stochastic approximation problem. For SGD, in the convex and smooth setting, we provide the first…
We discuss $L_p$-estimates for finite difference schemes approximating parabolic, possibly degenerate, SPDEs, with initial conditions from $W^m_p$ and free terms taking values in $W^m_p.$ Consequences of these estimates include an…
This paper focuses on explicit approximations for nonlinear stochastic delay differential equations (SDDEs). Under the weakly local Lipschitz and some suitable conditions, a generic truncated Euler-Maruyama (TEM) scheme for SDDEs is…
The vast majority of the literature on stochastic semidefinite programs (stochastic SDPs) with recourse is concerned with risk-neutral models. In this paper, we introduce mean-risk models for stochastic SDPs and study structural properties…
Augmented Lagrangian (AL) methods are a well known class of algorithms for solving constrained optimization problems. They have been extended to the solution of saddle-point systems of linear equations. We study an AL (SPAL) algorithm for…
We develop a skew-adaptive extension of split conformal prediction for regression. The method starts from an asymmetric interval family centered at a point prediction and uses the gauge approach to deduce the conformity score induced by…
We present an adaptive arbitrary-order accurate time-stepping numerical scheme for the flow of vesicles suspended in Stokesian fluids. Our scheme can be summarized as an approximate implicit spectral deferred correction (SDC) method.…