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…
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…
We review known linear and matrix generalizations of Hall's classic ``marriage theorem'' and K\H{o}nig's theorem on partial matchings in bipartite graphs, and relate them to linear and matrix generalizations of Dilworth's theorem about…
For large $R$, we consider measurable sets $A\subseteq [0,R]^2$ that avoid triples of points of the form $(x,y)$, $(x+t,y)$, $(x,y+1/t)$ with $x,y\in\mathbb{R}$ and $t>0$, i.e., the vertices of upward-oriented, axis-aligned right triangles…
We study the complex spectrum of the partial theta function \[ \Theta(q,x)=\sum_{j=0}^{\infty}q^{j(j+1)/2}x^j, \qquad |q|<1, \] where a spectral value is a parameter for which \(\Theta(q,\cdot)\) has a multiple zero. Since the function is…
The spectrum of Ramanujan's partial theta function $\theta (q,x):=\sum _{j=0}^{\infty}q^{j(j+1)/2}x^j$, $q\in \mathbb{D}_1$ (the unit disk centered at the origin), $x\in \mathbb{C}$, is the set of values of the parameter $q$ for which…
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…
Motivated by the recent work of Batkam-Tcheka on pointed multiplicative operads, we construct in this paper new chain complex algebras and two distinct bicomplex algebra structures on a free symmetric connected multiplicative differential…
In this work, we introduce a new class of Leibniz algebras, called quasi-Artinian Leibniz algebras, which generalizes the minimal condition on ideals. Furthermore, we provide some characterizations and give conditions under which a…
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…
The $(-1)$-Jacobi, Bannai-Ito, and $(-1)$-Meixner-Pollaczek polynomials are studied in [Trans. Amer. Math. Soc. 364 (2012), 5491-5507], [Adv. Math. 229 (2012), 2123-2158], and [Stud. Appl. Math. 153 (2024), e12728], respectively, through…
In this paper, we prove a spectral restriction theorem on the three-dimensional Heisenberg nilmanifold. Since this manifold is an $\mathbb S^1$-bundle over the flat torus $\mathbb T^2$, the result provides a sub-elliptic counterpart of…
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…
Sepsis remains a diagnostic challenge due to its heterogeneous molecular signatures and complex immune responses. In this study, we develop a logical data analysis framework based on Boolean polynomial rings. This method constructs an ideal…
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 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…
This paper studies the nonconvex quadratic root-difference minimization under elliptic annulus constraints {\rm (QR)}. We first establish the Annulus Brickman theorem and equivalently reformulate {\rm (QR)} as a 2-dimensional convex problem…
We propose restarted accelerated primal-dual algorithms with (non-monotone) backtracking (rAPDB) for convex nonlinear conic programs, with quadratically constrained quadratic programs (QCQPs) as a special case. Unlike linear and quadratic…
Purpose: This work aims to develop an image reconstruction algorithm for wide-angle digital breast tomosynthesis (DBT) that has improved depth resolution and in-plane contrast while reducing non-uniformity artifacts. Approach: The image…