Related papers: The Tammes Problem in $\mathbb{R}^{n}$ and Linear …
This work extends our previous study from S. Shrestha et al. (2024) by introducing a new abstract framework for Variational Multiscale (VMS) methods at the discrete level. We introduce the concept of what we define as the optimal projector…
The Bayesian online selection problem aims to design a pricing scheme for a sequence of arriving buyers that maximizes the expected social welfare (or revenue) subject to different structural constraints. Inspired by applications with a…
We show that the $A$-optimal design optimization problem over $m$ design points in $\mathbb{R}^n$ is equivalent to minimizing a quadratic function plus a group lasso sparsity inducing term over $n\times m$ real matrices. This observation…
We consider the extremal pointset configuration problem of maximizing a kernel-based energy subject to the geometric constraints that the points are contained in a fixed set, the pairwise distances are bounded below, and that every closed…
Optimization problems are considered in the framework of tropical algebra to minimize and maximize a nonlinear objective function defined on vectors over an idempotent semifield, and calculated using multiplicative conjugate transposition.…
Matrix factorization is an inference problem that has acquired importance due to its vast range of applications that go from dictionary learning to recommendation systems and machine learning with deep networks. The study of its fundamental…
Binary quadratic programming problems have attracted much attention in the last few decades due to their potential applications. This type of problems are NP-hard in general, and still considered a challenge in the design of efficient…
Finding the densest sphere packing in $d$-dimensional Euclidean space $\mathbb{R}^d$ is an outstanding fundamental problem with relevance in many fields, including the ground states of molecular systems, colloidal crystal structures, coding…
Association schemes are central objects in algebraic combinatorics, with the classical schemes lying at their core. These classical association schemes essentially consist of the Hamming and Johnson schemes, and their $q$-analogs: bilinear…
The present paper is devoted to studying of minimal parametric fillings of finite metric spaces (a version of optimal connection problem) by methods of Linear Programming. The estimate on the multiplicity of multi-tours appearing in the…
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,…
In this paper we study the subset sum problem with real numbers. Starting from the given problem, we formulate a quadratic maximization problem over a polytope, P, which is eventually written as a distance maximization to a fixed point over…
We consider the problem of computing the optimal meeting point of a set of N crab submarines. First, we analyze the case where the submarines are allowed any position on the real line: we provide a constructive proof of optimality and we…
In this paper, we study linear programming based approaches to the maximum matching problem in the semi-streaming model. The semi-streaming model has gained attention as a model for processing massive graphs as the importance of such graphs…
Linear diagrams are an effective way to visualize set-based data by representing elements as columns and sets as rows with one or more horizontal line segments, whose vertical overlaps with other rows indicate set intersections and their…
This paper studies the problem of enumerating all maximal collinear subsets of size at least three in a given set of $n$ points. An algorithm for this problem, besides solving degeneracy testing and the exact fitting problem, can also help…
In this paper, we study the non-bipartite maximum matching problem in the semi-streaming model. The maximum matching problem in the semi-streaming model has received a significant amount of attention lately. While the problem has been…
Tusn\'ady's problem asks to bound the discrepancy of points and axis-parallel boxes in $\mathbb{R}^d$. Algorithmic bounds on Tusn\'ady's problem use a canonical decomposition of Matou\v{s}ek for the system of points and axis-parallel boxes,…
We present an O(mn^2) algorithm for linear programming over the real numbers with n primal and m dual variables through deciding the support set a of an optimal solution. Let z and e be two 2(n+m)-tuples with z representing the primal, dual…
Given a dissimilarity matrix, the metric nearness problem is to find the nearest matrix of distances that satisfy the triangle inequalities. This problem has wide applications, such as sensor networks, image processing, and so on. But it is…