3,471 research outputs found
A Framework for Globally Optimizing Mixed-Integer Signomial Programs
Mixed-integer signomial optimization problems have broad applicability in engineering. Extending the Global Mixed-Integer Quadratic Optimizer, GloMIQO (Misener, Floudas in J. Glob. Optim., 2012. doi:10.1007/s10898-012-9874-7), this manuscript documents a computational framework for deterministically addressing mixed-integer signomial optimization problems to ε-global optimality. This framework generalizes the GloMIQO strategies of (1) reformulating user input, (2) detecting special mathematical structure, and (3) globally optimizing the mixed-integer nonconvex program. Novel contributions of this paper include: flattening an expression tree towards term-based data structures; introducing additional nonconvex terms to interlink expressions; integrating a dynamic implementation of the reformulation-linearization technique into the branch-and-cut tree; designing term-based underestimators that specialize relaxation strategies according to variable bounds in the current tree node. Computational results are presented along with comparison of the computational framework to several state-of-the-art solvers. © 2013 Springer Science+Business Media New York
Algorithm engineering for optimal alignment of protein structure distance matrices
Protein structural alignment is an important problem in computational
biology. In this paper, we present first successes on provably optimal pairwise
alignment of protein inter-residue distance matrices, using the popular Dali
scoring function. We introduce the structural alignment problem formally, which
enables us to express a variety of scoring functions used in previous work as
special cases in a unified framework. Further, we propose the first
mathematical model for computing optimal structural alignments based on dense
inter-residue distance matrices. We therefore reformulate the problem as a
special graph problem and give a tight integer linear programming model. We
then present algorithm engineering techniques to handle the huge integer linear
programs of real-life distance matrix alignment problems. Applying these
techniques, we can compute provably optimal Dali alignments for the very first
time
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
On Minimal Valid Inequalities for Mixed Integer Conic Programs
We study disjunctive conic sets involving a general regular (closed, convex,
full dimensional, and pointed) cone K such as the nonnegative orthant, the
Lorentz cone or the positive semidefinite cone. In a unified framework, we
introduce K-minimal inequalities and show that under mild assumptions, these
inequalities together with the trivial cone-implied inequalities are sufficient
to describe the convex hull. We study the properties of K-minimal inequalities
by establishing algebraic necessary conditions for an inequality to be
K-minimal. This characterization leads to a broader algebraically defined class
of K- sublinear inequalities. We establish a close connection between
K-sublinear inequalities and the support functions of sets with a particular
structure. This connection results in practical ways of showing that a given
inequality is K-sublinear and K-minimal.
Our framework generalizes some of the results from the mixed integer linear
case. It is well known that the minimal inequalities for mixed integer linear
programs are generated by sublinear (positively homogeneous, subadditive and
convex) functions that are also piecewise linear. This result is easily
recovered by our analysis. Whenever possible we highlight the connections to
the existing literature. However, our study unveils that such a cut generating
function view treating the data associated with each individual variable
independently is not possible in the case of general cones other than
nonnegative orthant, even when the cone involved is the Lorentz cone
Intermediate integer programming representations using value disjunctions
We introduce a general technique to create an extended formulation of a
mixed-integer program. We classify the integer variables into blocks, each of
which generates a finite set of vector values. The extended formulation is
constructed by creating a new binary variable for each generated value. Initial
experiments show that the extended formulation can have a more compact complete
description than the original formulation.
We prove that, using this reformulation technique, the facet description
decomposes into one ``linking polyhedron'' per block and the ``aggregated
polyhedron''. Each of these polyhedra can be analyzed separately. For the case
of identical coefficients in a block, we provide a complete description of the
linking polyhedron and a polynomial-time separation algorithm. Applied to the
knapsack with a fixed number of distinct coefficients, this theorem provides a
complete description in an extended space with a polynomial number of
variables.Comment: 26 pages, 5 figure
Bounds for the genus of a normal surface
This paper gives sharp linear bounds on the genus of a normal surface in a
triangulated compact, orientable 3--manifold in terms of the quadrilaterals in
its cell decomposition---different bounds arise from varying hypotheses on the
surface or triangulation. Two applications of these bounds are given. First,
the minimal triangulations of the product of a closed surface and the closed
interval are determined. Second, an alternative approach to the realisation
problem using normal surface theory is shown to be less powerful than its dual
method using subcomplexes of polytopes.Comment: 38 pages, 25 figure
- …