Related papers: An application of linear programming duality to di…
R\'esum\'e Apr\`es un bref aper\c{c}u permettant de situer notre travail, nous proposons une nouvelle voie pour aborder la programmation lin\'eaire en proposant un algorithme \'elabor\'e \`a partir d'une id\'ee simple qui permet d'obtenir…
This paper presents the Lagrangian duality theory for mixed-integer semidefinite programming (MISDP). We derive the Lagrangian dual problem and prove that the resulting Lagrangian dual bound dominates the bound obtained from the continuous…
We prove that if two additive functions (from a certain class) take large values with roughly the same probability then they must be identical. The Kac-Kubilius model suggests that the distribution of values of a given additive function can…
Macaulay dual spaces provide a local description of an affine scheme and give rise to computational machinery that is compatible with the methods of numerical algebraic geometry. We introduce eliminating dual spaces, use them for computing…
Context: Reynolds showed us how to use continuation-passing style and defunctionalization to transform a recursive interpreter for a language into an abstract machine for programs in that language. The same techniques explain other…
Let $f_1,\...,f_r$ be polynomials in $n$ variables over a finite field $F$ of cardinality $q$ and characteristic $p$. Let $f_i$ have total degree $d_i$ and define $d=d_1+\...+d_r$. Write $Z$ for the set of common zeros of the $f_i$, over…
The application of operator overloading algorithmic differentiation (AD) to computer programs in order to compute the derivative is quite common. But, the replacement of the underlying computational floating point type with the specialized…
In semidefinite programming the dual may fail to attain its optimal value and there could be a duality gap, i.e., the primal and dual optimal values may differ. In a striking paper, Ramana proposed a polynomial size extended dual that does…
In this paper, we remind previous results about the tilings $\{p,q\}$ of the hyperbolic plane. We introduce two new ways to split the hyperbolic plane in order to algorithmically construct the tilings $\{p,q\}$ when $q$ is odd.
We develop a compositional approach for automatic and symbolic differentiation based on categorical constructions in functional analysis where derivatives are linear functions on abstract vectors rather than being limited to scalars,…
We show how categorial deduction can be implemented in higher-order (linear) logic programming, thereby realising parsing as deduction for the associative and non-associative Lambek calculi. This provides a method of solution to the parsing…
In this paper, we provide an elementary, geometric, and unified framework to analyze conic programs that we call the strict complementarity approach. This framework allows us to establish error bounds and quantify the sensitivity of the…
Recently a new approach to varying exponent $L^{p(\cdot)}$ space norms employing weak solutions to first order ordinary differential equations was initiated by the author. The duality of these ODE-determined $L^{p(\cdot)}$ spaces is…
Prioritized default reasoning has illustrated its rich expressiveness and flexibility in knowledge representation and reasoning. However, many important aspects of prioritized default reasoning have yet to be thoroughly explored. In this…
Over the years, integer linear programs have been employed to model inference in many natural language processing problems. This survey is meant to guide the reader through the process of framing a new inference problem as an instance of an…
Linear discrimination, from the point of view of numerical linear algebra, can be treated as solving an ill-posed system of linear equations. In order to generate a solution that is robust in the presence of noise, these problems require…
We generalize the classic Fourier transform operator $\mathcal{F}_{p}$ by using the Henstock-Kurzweil integral theory. It is shown that the operator equals the $HK$-Fourier transform on a dense subspace of $\mathcal{ L}^p$, $1<p\leq 2$. In…
We present a hardware-based implementation of Linear Program (LP) decoding for binary linear codes. LP decoding frames error-correction as an optimization problem. In contrast, variants of Belief Propagation (BP) decoding frame…
Suppose q is a complex number of modulus one and different from 1,-1. Let O(R^2_q) be the *-algebra with two hermitean generators x and y satisfying the relation xy=qyx. Using operator representations of the *-algebra O(R^2_q) on Hilbert…
An arithmetical discrete plane is said to have critical connecting thickness if its thickness is equal to the infimum of the set of values that preserve its $2$-connectedness. This infimum thickness can be computed thanks to the fully…