Related papers: Understanding Christensen-Sinclair factorization v…
Lemma 1 from the paper [N.E. Gretsky, J.M. Ostroy, W.R. Zame, Subdifferentiability and the duality gap, Positivity 6: 261--274, 2002] asserts that the value function $v$ of an infinite dimensional linear programming problem in standard form…
We prove the existence of a ternary sequence of factor complexity $2n+1$ for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a…
In this paper, we study chance constrained mixed integer program with consideration of recourse decisions and their incurred cost, developed on a finite discrete scenario set. Through studying a non-traditional bilinear mixed integer…
The strict complementary slackness condition (SCSC) is an important concept in the duality theory of linear programming (LP). The current study aims at extending this concept to the framework of linear fractional programming (LFP). First,…
We prove that any complete metric space has a unique decomposition as a direct product of a possibly finite or zero-dimensional Hilbert space and a space that does not split off lines.
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…
A rational number can be naturally presented by an arithmetic computation (AC): a sequence of elementary arithmetic operations starting from a fixed constant, say 1. The asymptotic complexity issues of such a representation are studied e.g.…
This paper considers an inexact primal-dual algorithm for semi-infinite programming (SIP) for which it provides general error bounds. To implement the dual variable update, we create a new prox function for nonnegative measures which turns…
We study 2-point and 3-point functions in CFT at finite temperature for large dimension operators using holography. The 2-point function leads to a universal formula for the holographic free energy in $d$ dimensions in terms of the…
We investigate compressibility of the dimension of positive semidefinite matrices while approximately preserving their pairwise inner products. This can either be regarded as compression of positive semidefinite factorizations of…
Let $X$ be an operator space, let $\phi$ be a product on $X$, and let $(X,\phi)$ denote the algebra that one obtains. We give necessary and sufficient conditions on the bilinear mapping $\phi$ for the algebra $(X,\phi)$ to have a completely…
Let $\E$ be a finite dimensional Hilbert space. This note finds all factorizations of the right shift semigroup $\S^\E=(S_t^\E)_{t\ge 0}$ on $L^2(\R_+,\E)$ into the product of $n$ commuting contractive semigroups, i.e., characterizes all…
This paper develops distributed synchronous and asynchronous algorithms for the large-scale semi-definite programming with diagonal constraints, which has wide applications in combination optimization, image processing and community…
Large integer factorization is a prominent research challenge, particularly in the context of quantum computing. This holds significant importance, especially in information security that relies on public key cryptosystems. The classical…
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…
The min-knapsack problem with compactness constraints extends the classical knapsack problem, in the case of ordered items, by introducing a restriction ensuring that they cannot be too far apart. This problem has applications in…
In a common formulation of semi-infinite programs, the infinite constraint set is a requirement that a function parametrized by the decision variables is nonnegative over an interval. If this function is sufficiently closely approximable by…
In this note, we use a natural desingularization of the conormal variety of the variety of n x n symmetric matrices of rank at most r to find a general formula for the algebraic degree in semidefinite programming.
We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…
We give the first approximation algorithm for mixed packing and covering semidefinite programs (SDPs) with polylogarithmic dependence on width. Mixed packing and covering SDPs constitute a fundamental algorithmic primitive with recent…