1,398 research outputs found
Equivalence of primal and dual simplex algorithms for the maximum flow problem
Cover title.Includes bibliographical references (p. 12).Supported in part by the ONR. N00014-1-0099 Supported in part by a grant from the UPS Foundation.by Ravindra K. Ahuja, James B. Orlin
BROJA-2PID: A robust estimator for bivariate partial information decomposition
Makkeh, Theis, and Vicente found in [8] that Cone Programming model is the
most robust to compute the Bertschinger et al. partial information decompostion
(BROJA PID) measure [1]. We developed a production-quality robust software that
computes the BROJA PID measure based on the Cone Programming model. In this
paper, we prove the important property of strong duality for the Cone Program
and prove an equivalence between the Cone Program and the original Convex
problem. Then describe in detail our software and how to use it.\newline\inden
Adapting the interior point method for the solution of LPs on serial, coarse grain parallel and massively parallel computers
In this paper we describe a unified scheme for implementing an interior point algorithm (IPM) over a range of computer architectures. In the inner iteration of the IPM a search direction is computed using Newton's method. Computationally this involves solving a sparse symmetric positive definite (SSPD) system of equations. The choice of direct and indirect methods for the solution of this system, and the design of data structures to take advantage of serial, coarse grain parallel and massively parallel computer architectures, are considered in detail. We put forward arguments as to why integration of the system within a sparse simplex solver is important and outline how the system is designed to achieve this integration
Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms
Mathematical programming is a branch of applied mathematics and has recently
been used to derive new decoding approaches, challenging established but often
heuristic algorithms based on iterative message passing. Concepts from
mathematical programming used in the context of decoding include linear,
integer, and nonlinear programming, network flows, notions of duality as well
as matroid and polyhedral theory. This survey article reviews and categorizes
decoding methods based on mathematical programming approaches for binary linear
codes over binary-input memoryless symmetric channels.Comment: 17 pages, submitted to the IEEE Transactions on Information Theory.
Published July 201
An update on the Hirsch conjecture
The Hirsch conjecture was posed in 1957 in a letter from Warren M. Hirsch to
George Dantzig. It states that the graph of a d-dimensional polytope with n
facets cannot have diameter greater than n - d.
Despite being one of the most fundamental, basic and old problems in polytope
theory, what we know is quite scarce. Most notably, no polynomial upper bound
is known for the diameters that are conjectured to be linear. In contrast, very
few polytopes are known where the bound is attained. This paper collects
known results and remarks both on the positive and on the negative side of the
conjecture. Some proofs are included, but only those that we hope are
accessible to a general mathematical audience without introducing too many
technicalities.Comment: 28 pages, 6 figures. Many proofs have been taken out from version 2
and put into the appendix arXiv:0912.423
A Discrete Theory of Connections on Principal Bundles
Connections on principal bundles play a fundamental role in expressing the
equations of motion for mechanical systems with symmetry in an intrinsic
fashion. A discrete theory of connections on principal bundles is constructed
by introducing the discrete analogue of the Atiyah sequence, with a connection
corresponding to the choice of a splitting of the short exact sequence.
Equivalent representations of a discrete connection are considered, and an
extension of the pair groupoid composition, that takes into account the
principal bundle structure, is introduced. Computational issues, such as the
order of approximation, are also addressed. Discrete connections provide an
intrinsic method for introducing coordinates on the reduced space for discrete
mechanics, and provide the necessary discrete geometry to introduce more
general discrete symmetry reduction. In addition, discrete analogues of the
Levi-Civita connection, and its curvature, are introduced by using the
machinery of discrete exterior calculus, and discrete connections.Comment: 38 pages, 11 figures. Fixed labels in figure
- …