4,347 research outputs found
Exploiting Symmetry in Integer Convex Optimization using Core Points
We consider convex programming problems with integrality constraints that are
invariant under a linear symmetry group. To decompose such problems we
introduce the new concept of core points, i.e., integral points whose orbit
polytopes are lattice-free. For symmetric integer linear programs we describe
two algorithms based on this decomposition. Using a characterization of core
points for direct products of symmetric groups, we show that prototype
implementations can compete with state-of-the-art commercial solvers, and solve
an open MIPLIB problem.Comment: 15 pages; small changes according to suggestions of a referee; to
appear in Operations Research Letter
On Lattice-Free Orbit Polytopes
Given a permutation group acting on coordinates of , we
consider lattice-free polytopes that are the convex hull of an orbit of one
integral vector. The vertices of such polytopes are called \emph{core points}
and they play a key role in a recent approach to exploit symmetry in integer
convex optimization problems. Here, naturally the question arises, for which
groups the number of core points is finite up to translations by vectors fixed
by the group. In this paper we consider transitive permutation groups and prove
this type of finiteness for the -homogeneous ones. We provide tools for
practical computations of core points and obtain a complete list of
representatives for all -homogeneous groups up to degree twelve. For
transitive groups that are not -homogeneous we conjecture that there exist
infinitely many core points up to translations by the all-ones-vector. We prove
our conjecture for two large classes of groups: For imprimitive groups and
groups that have an irrational invariant subspace.Comment: 27 pages, 2 figures; with minor adaptions according to referee
comments; to appear in Discrete and Computational Geometr
Conic Optimization Theory: Convexification Techniques and Numerical Algorithms
Optimization is at the core of control theory and appears in several areas of
this field, such as optimal control, distributed control, system
identification, robust control, state estimation, model predictive control and
dynamic programming. The recent advances in various topics of modern
optimization have also been revamping the area of machine learning. Motivated
by the crucial role of optimization theory in the design, analysis, control and
operation of real-world systems, this tutorial paper offers a detailed overview
of some major advances in this area, namely conic optimization and its emerging
applications. First, we discuss the importance of conic optimization in
different areas. Then, we explain seminal results on the design of hierarchies
of convex relaxations for a wide range of nonconvex problems. Finally, we study
different numerical algorithms for large-scale conic optimization problems.Comment: 18 page
Fast Fourier Optimization: Sparsity Matters
Many interesting and fundamentally practical optimization problems, ranging
from optics, to signal processing, to radar and acoustics, involve constraints
on the Fourier transform of a function. It is well-known that the {\em fast
Fourier transform} (fft) is a recursive algorithm that can dramatically improve
the efficiency for computing the discrete Fourier transform. However, because
it is recursive, it is difficult to embed into a linear optimization problem.
In this paper, we explain the main idea behind the fast Fourier transform and
show how to adapt it in such a manner as to make it encodable as constraints in
an optimization problem. We demonstrate a real-world problem from the field of
high-contrast imaging. On this problem, dramatic improvements are translated to
an ability to solve problems with a much finer grid of discretized points. As
we shall show, in general, the "fast Fourier" version of the optimization
constraints produces a larger but sparser constraint matrix and therefore one
can think of the fast Fourier transform as a method of sparsifying the
constraints in an optimization problem, which is usually a good thing.Comment: 16 pages, 8 figure
Computing symmetry groups of polyhedra
Knowing the symmetries of a polyhedron can be very useful for the analysis of
its structure as well as for practical polyhedral computations. In this note,
we study symmetry groups preserving the linear, projective and combinatorial
structure of a polyhedron. In each case we give algorithmic methods to compute
the corresponding group and discuss some practical experiences. For practical
purposes the linear symmetry group is the most important, as its computation
can be directly translated into a graph automorphism problem. We indicate how
to compute integral subgroups of the linear symmetry group that are used for
instance in integer linear programming.Comment: 20 pages, 1 figure; containing a corrected and improved revisio
- …