Mathematics
In this paper, we are dealing with constrained vector optimisation problems where the objective function acts between real linear-topological spaces. Our aim is to study the relationships between the sets of properly efficient solutions to…
Physics-informed neural networks (PINNs) formulate the solution of partial differential equations as residual minimization problems over neural network parameterizations. Although highly flexible, optimization of PINNs using modern variants…
We propose Acc-Sinkhorn, a simple accelerated variant of Sinkhorn for entropy-regularized optimal transport (EOT). The method is derived from a bilevel optimization view: Sinkhorn row scaling solves the inner variable $u$ exactly and…
Given a matrix $A$, a matrix nearness problem seeks an $X$ that most closely approximates $A$ in the sense of minimizing $\lVert A - X\rVert$ under a variety of constraints on $X$. A generalized matrix nearness problem seeks the same but…
We consider the numerical solution of partial differential equations with coefficients that are strongly heterogeneous in space. We provide an overview of higher-order localized orthogonal decomposition (LOD) methods for the elliptic…
Let $\mathcal{H}(b)$ be the de Branges-Rovnyak space associated to a non-extreme point $b$ of the unit ball of $H^\infty$, and let $\phi=b/a$, where $a$ is the Pythagorean mate of $b$. It is known that, if $f$ is a function holomorphic on a…
A novel mixed spectral-Galerkin method based on generalized ball polynomials is proposed for solving the biharmonic equation on a unit ball. By introducing an auxiliary variable to decouple the biharmonic equation into a system of…
Developing high-order numerical schemes for two-phase flow in porous media that preserve key physical properties remains a significant challenge in numerical analysis. In this article, we propose a general framework to construct fully…
The asymptotic Karush-Kuhn-Tucker (AKKT) optimality conditions are distinguished from other approaches in the literature by virtue of their capacity to be effectively derived through numerical methods, such as the utilization of an…
This paper studies a type of rank-based mean field game in which competing agents strategically switch among multiple effort regimes. We propose an entropy regularized auxiliary problem where the switching decisions are randomized to the…
Distributed online stochastic optimization has received extensive attention in large-scale distributed learning and other related fields due to its unique advantage in processing streaming data. However, information exchange through the…
Let $\mathfrak{g}$ be a symmetrizable Kac-Moody Lie algebra and let $\rho$ denote the sum of the fundamental weights. The irreducible highest weight representations $V(m\rho)$ occupy a distinguished position in representation theory due to…
We propose a new disjunctive regularization for mathematical programs with complementarity constraints (MPCC). Its feasible set coincides with that of the Kanzow-Schwartz regularization. However, their functional descriptions differ…
In this paper, we study a structured class of nonconvex constrained stochastic problems with difference-of-convex (DC) regularization, where the feasible set is possibly nonconvex and the concave part of the DC regularizer is allowed to be…
We present a high-order implicit-explicit discontinuous Galerkin (IMEX-DG) solver for the compressible Euler equations to account for rotational effects within a fully compressible atmospheric framework. Time integration follows a…
In this paper, we present a quantum implicit-explicit (IMEX) scheme for multiscale ordinary and partial differential equations whose discretization parameters are independent of the scaling parameter $\varepsilon$. A key ingredient of our…
We give a simple example of a polynomial contraction automorphism of $\mathbb C^d$, $ d\ge 3 $, with unbounded degree growth. Combined with Poincar\'e-Dulac theorem it provides an algebraic automorphism of $\mathbb C^d$, $ d\ge 3 $, which…
We study the subclass of potential mean-field games in which the running interaction cost and the terminal target cost are both expressed through reproducing-kernel maximum mean discrepancy (MMD) penalties, and develop a computational…
We propose a high-order numerical methodology for computing the ground state and time evolution of the two-dimensional Gross-Pitaevskii equation with harmonic trapping potential. The ground state is obtained by combining normalized gradient…
This work presents a weighted quadrature (WQ) method to fast assemble Galerkin matrices based on unstructured spline surfaces. The method is developed upon a particular variant of unstructured splines, namely the bicubic analysis-suitable…