Related papers: A Constrained-Gradient Method to Control Divergenc…
Large-scale constrained optimization problems are at the core of many tasks in control, signal processing, and machine learning. Notably, problems with functional constraints arise when, beyond a performance{\nobreakdash-}centric goal…
GAMER, a parallel Graphic-processing-unit-accelerated Adaptive-MEsh-Refinement hydrodynamic code, has been extended to support magnetohydrodynamics (MHD) with both the corner-transport-upwind (CTU) and MUSCL-Hancock schemes and the…
We present a single step, second-order accurate Godunov scheme for ideal MHD which is an extension of the method described by Gardiner & Stone (2005) to three dimensions. This algorithm combines the corner transport upwind (CTU) method of…
We develop a new second-order unstaggered path-conservative central-upwind (PCCU) scheme for ideal and shallow water magnetohydrodynamics (MHD) equations. The new scheme possesses several important properties: it locally preserves the…
This paper studies a decentralized stochastic gradient tracking (DSGT) algorithm for non-convex empirical risk minimization problems over a peer-to-peer network of nodes, which is in sharp contrast to the existing DSGT only for convex…
We consider the bilinear optimal control of an advection-reaction-diffusion system, where the control arises as the velocity field in the advection term. Such a problem is generally challenging from both theoretical analysis and algorithmic…
While Nesterov's Accelerated Gradient Descent (AGD) efficiently solves constrained problems when the constraint set $X \subseteq \mathbb{R}^n$ is simple and easy to project onto, it remains an open question whether function-constrained…
We develop randomized (block) coordinate descent (CD) methods for linearly constrained convex optimization. Unlike most CD methods, we do not assume the constraints to be separable, but let them be coupled linearly. To our knowledge, ours…
Stochastic gradient descent (SGD) is the main algorithm behind a large body of work in machine learning. In many cases, constraints are enforced via projections, leading to projected stochastic gradient algorithms. In recent years, a large…
We present a fourth-order accurate finite volume method for the solution of ideal magnetohydrodynamics (MHD). The numerical method combines high-order quadrature rules in the solution of semi-discrete formulations of hyperbolic conservation…
This paper considers the Byzantine fault-tolerance problem in distributed stochastic gradient descent (D-SGD) method - a popular algorithm for distributed multi-agent machine learning. In this problem, each agent samples data points…
We consider randomized block coordinate stochastic mirror descent (RBSMD) methods for solving high-dimensional stochastic optimization problems with strongly convex objective functions. Our goal is to develop RBSMD schemes that achieve a…
Computational electrodynamics (CED), the numerical solution of Maxwell's equations, plays an incredibly important role in several problems in science and engineering. High accuracy solutions are desired, and the discontinuous Galerkin (DG)…
Online learning algorithms require to often recompute least squares regression estimates of parameters. We study improving the computational complexity of such algorithms by using stochastic gradient descent (SGD) type schemes in place of…
A novel approach for selecting appropriate reconstructions is implemented to the hyperbolic conservation laws in the high-order local polynomial-based framework, e.g., the discontinuous Galerkin (DG) and flux reconstruction (FR) schemes.…
Recent studies have shown that fractional calculus is an effective alternative mathematical tool in various scientific fields. However, some investigations indicate that results established in differential and integral calculus do not…
Many real-world problems are categorized as large-scale problems, and metaheuristic algorithms as an alternative method to solve large-scale problem; they need the evaluation of many candidate solutions to tackle them prior to their…
We propose mS2GD: a method incorporating a mini-batching scheme for improving the theoretical complexity and practical performance of semi-stochastic gradient descent (S2GD). We consider the problem of minimizing a strongly convex function…
This work presents an extension of discretely entropy stable discontinuous Galerkin (DG) methods to the resistive magnetohydrodynamics (MHD) equations. Although similar to the compressible Navier-Stokes equations at first sight, there are…
Conjugate gradient minimization methods (CGM) and their accelerated variants are widely used. We focus on the use of cubic regularization to improve the CGM direction independent of the step length computation. In this paper, we propose the…