Search
Search Results
-
Calculating the Sum of Multidigit Values in a Parallel Computational Model
The authors propose a new method for finding the sum of two or more multidigit values in a parallel computational model. The method reduces finding...
-
On the Mean Value of the Generalized Dedekind Sum and Certain Generalized Hardy Sums Weighted by the Kloosterman Sum
We study a hybrid mean-value problem related to the generalized Dedekind sum, certain generalized Hardy sums, and Kloosterman sum and obtain several...
-
The best constant for inequality involving the sum of the reciprocals and product of positive numbers with unit sum
In this paper, we study a special algebraic inequality containing a parameter, the sum of reciprocals and the product of positive real numbers whose...
-
-
Domain of Existence of the Sum of a Series of Exponential Monomials
AbstractIn the paper, series of exponential monomials are considered. We study the problem of the distribution of singular points of the sum of a...
-
Optimal Analysis of Method with Batching for Monotone Stochastic Finite-Sum Variational Inequalities
AbstractVariational inequalities are a universal optimization paradigm that is interesting in itself, but also incorporates classical minimization...
-
Lorentzian connections with parallel twistor-free torsion
We describe Lorentzian manifolds that admit metric connections with parallel torsion having zero twistorial component and non-zero vectorial...
-
HSVI Can Solve Zero-Sum Partially Observable Stochastic Games
State-of-the-art methods for solving 2-player zero-sum imperfect information games rely on linear programming or regret minimization, though not on...
-
Exponential-time algorithms for parallel machine scheduling problems
In this paper we consider the problem of scheduling a set of jobs on unrelated parallel machines in the presence of job release dates and deadlines,...
-
Reassessing Zero-Sum Games: Various Types of Matching Pennies
This chapter continues to critically reassess the significance and limitations of zero-sum games, which were jointly established by mathematician...
-
Enumeration of Labeled Series-Parallel Tricyclic Graphs
A series-parallel graph is a graph that does not contain a complete graph with four vertices as a minor. An explicit formula for the number of...
-
A Boosted-DCA with Power-Sum-DC Decomposition for Linearly Constrained Polynomial Programs
This paper proposes a novel Difference-of-Convex (DC) decomposition for polynomials using a power-sum representation, achieved by solving a sparse...
-
Generalization of the Subset Sum Problem and Cubic Forms
AbstractA new algorithm is proposed for deciding whether a system of linear equations has a binary solution over a field of zero characteristic. The...
-
Parallel 3D topology optimization with multiple constraints and objectives
This paper introduces a parallel Topology Optimization (TO) platform capable of optimizing designs for multiple objectives, whilst subject to...
-
Sum-of-squares relaxations for polynomial min–max problems over simple sets
We consider min–max optimization problems for polynomial functions, where a multivariate polynomial is maximized with respect to a subset of...
-
On Locally Boundedly Exactly Doubly Transitive Lie Groups of Transformations of the Space with a Subgroup of Parallel Translations
AbstractThe paper solves the problem of extending the group of parallel translations of the three-dimensional space to a locally boundedly exactly...
-
Parallel and distributed asynchronous adaptive stochastic gradient methods
Stochastic gradient methods (SGMs) are the predominant approaches to train deep learning models. The adaptive versions (e.g., Adam and AMSGrad) have...
-
Privacy-Preserving Dual Stochastic Push-Sum Algorithm for Distributed Constrained Optimization
This paper investigates a private distributed optimization problem over a multi-agent network, where the goal is to cooperatively minimize the sum of...
