Related papers: Randomized Runge-Kutta method -- stability and con…
In this paper we propose a variant of the random coordinate descent method for solving linearly constrained convex optimization problems with composite objective functions. If the smooth part of the objective function has Lipschitz…
This paper investigates the performance of a subclass of exponential integrators, specifically explicit exponential Runge--Kutta methods. It is well known that third-order methods can suffer from order reduction when applied to linearized…
In this article, we discuss the numerical solution of Boolean polynomial programs by algorithms borrowing from numerical methods for differential equations, namely the Houbolt scheme, the Lie scheme, and a Runge-Kutta scheme. We first…
Quantum mechanics predicts the existence of intrinsically random processes. Contrary to classical randomness, this lack of predictability can not be attributed to ignorance or lack of control. Here we find the optimal method to quantify the…
This paper focuses on investigating an inexact stochastic model-based optimization algorithm that integrates preconditioning techniques for solving stochastic composite optimization problems. The proposed framework unifies and extends the…
Multiphysics systems are driven by multiple processes acting simultaneously, and their simulation leads to partitioned systems of differential equations. This paper studies the solution of partitioned systems of differential equations using…
A novel reduced-order model (ROM) formulation for incompressible flows is presented with the key property that it exhibits non-linearly stability, independent of the mesh (of the full order model), the time step, the viscosity, and the…
We investigate the strong stability preserving (SSP) property of two-step Runge-Kutta (TSRK) methods. We prove that all SSP TSRK methods belong to a particularly simple subclass of TSRK methods, in which stages from the previous step are…
This paper presents a novel two-step approach for the fundamental problem of learning an optimal map from one distribution to another. First, we learn an optimal transport (OT) plan, which can be thought as a one-to-many map between the two…
Li, Chen, Tai & E. (J. Machine Learning Research, 2018) have proposed a regularization of the forward-backward sweep iteration for solving the Pontryagin maximum principle in optimal control problems. The authors prove the global…
The "fast iterative shrinkage-thresholding algorithm", a.k.a. FISTA, is one of the most well-known first-order optimisation scheme in the literature, as it achieves the worst-case $O(1/k^2)$ optimal convergence rate in terms of objective…
We explore a novel way to numerically resolve the scaling behavior of finite-time singularities in solutions of nonlinear parabolic PDEs. The Runge--Kutta--Legendre (RKL) and Runge--Kutta--Gegenbauer (RKG) super-time-stepping methods were…
In this paper, we develop two new randomized block-coordinate optimistic gradient algorithms to approximate a solution of nonlinear equations in large-scale settings, which are called root-finding problems. Our first algorithm is…
We present second-order optimally stable Implicit-Explicit (IMEX) Runge-Kutta (RK) schemes with application to a modified set of shallow water equations that can be used to model the dynamics of lava flows. The schemes are optimally stable…
The optimal $k$-thresholding (OT) and optimal $k$-thresholding pursuit (OTP) are newly introduced frameworks of thresholding techniques for compressed sensing and signal approximation. Such frameworks motivate the practical and efficient…
We study the construction and convergence of semi-explicit and iterative decoupling schemes for an elliptic-parabolic problem using higher-order Runge-Kutta methods. For the semi-explicit schemes, which are constructed using a nearby delay…
We present a unified approach for constraint displacement problems in which a robot finds a feasible path by displacing constraints or obstacles. To this end, we propose a two stage process that returns locally optimal obstacle…
A time discretization method is called strongly stable, if the norm of its numerical solution is nonincreasing. It is known that, even for linear semi-negative problems, many explicit Runge--Kutta (RK) methods fail to preserve this…
This work aims to solve a stochastic nonconvex nonsmooth composite optimization problem. Previous works on composite optimization problem requires the major part to satisfy Lipschitz smoothness or some relaxed smoothness conditions, which…
This paper investigates the energy conservation properties of explicit Runge--Kutta (RK) time discretizations for autonomous skew-symmetric systems. For linear problems, we present a general framework for constructing RK methods in which…