Related papers: SPM Bulletin 5 (Special issue)
In [Steinerberger, Q. Appl. Math., 79:3, 419-429, 2021] and [Shao, SIAM J. Matrix Anal. Appl. 44(1), 212-239, 2023], two new types of Kaczmarz algorithms, which share some similarities, for consistent linear systems were proposed. These two…
Consider the commonly known puzzle, given $k$ glass balls, find an optimal algorithm to determine the lowest floor of a building of $n$ floors from which a thrown glass ball will break. This puzzle was originally posed in its original form…
Many problems in optimization theory are strongly nonlinear in the traditional sense but possess a hidden linear structure over suitable idempotent semirings. After an overview of `Idempotent Mathematics' with an emphasis on matrix theory,…
We study Hamamoto's expanding square argument towards a 1-D minimisation problem related to the sharp solenoidal uncertainty principle. Working in the right function space, we recast the involved interpolation type inequality into an exact…
The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…
We computationally investigate the complete polytope of Bell inequalities for 2 particles with small numbers of possible measurements and outcomes. Our approach is limited by Pitowsky's connection of this problem to the computationally hard…
This paper defines multidimensional sequential optimization numbers and prove that the unsigned Stirling numbers of first kind are 1-dimensional sequential optimization numbers. This paper gives a recurrence formula and an upper bound of…
We show that any submodular minimization (SM) problem defined on a linear constraint set with constraints having up to two variables per inequality, are 2-approximable in polynomial time. If the constraints are monotone (the two variables…
In this paper, we almost completely solve the existence of an almost resolvable cycle system with odd cycle length. We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the…
Finite dimensional solutions to a class of stochastic partial differential equations are obtained extending the differential constraints method for deterministic PDE to the stochastic framework. A geometrical reformulation of the stochastic…
Shelah's own proof to his recent polarized partition theorem involving a singular strong limit that violates the GCH is presented. The proof is slightly re-arranges so that no use of the ideal I[\lambda] is made. The proof should be…
This paper is essentially an exercise in studying the minima of a certain least squares optimization using the second partial derivative test. The motivation is to gain insight into an optimization-based solution to the problem of tracking…
After the observation in 2012 of a new scalar particle closely resembling the Higgs boson of the Standard Model of particle physics, there is a general consensus that there must be Physics Beyond the Standard Model, with present experiments…
The classical P\'olya-Tchebotarev problem, commonly stated as a max-min logarithmic energy problem, asks for finding a compact of minimal capacity in the complex plane which connects a prescribed collection of fixed points. Variants of this…
The article presents a study of rather simple local search heuristics for the single machine total weighted tardiness problem (SMTWTP), namely hillclimbing and Variable Neighborhood Search. In particular, we revisit these approaches for the…
We consider the multilinear pagerank problem studied in [Gleich, Lim and Yu, Multilinear Pagerank, 2015], which is a system of quadratic equations with stochasticity and nonnegativity constraints. We use the theory of quadratic vector…
Many combinatorial optimization problems entail a number of hierarchically dependent optimization problems. An often used solution is to associate a suitably large cost with each individual optimization problem, such that the solution of…
Given a set of squares and a strip of bounded width and infinite height, we consider a square strip packaging problem, which we call the square independent packing problem (SIPP), to minimize the strip height so that all the squares are…
The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…
The Thomson Problem, arrangement of identical charges on the surface of a sphere, has found many applications in physics, chemistry and biology. Here we show that the energy landscape of the Thomson Problem for $N$ particles with $N=132,…