Exploiting symmetry in integer convex optimization using core points
نویسندگان
چکیده
منابع مشابه
Polyhedral approximation in mixed-integer convex optimization
Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. In this paper, we intend to provide a broadly accessible introduction to our recent work in developing algorithms and software for this problem class. Our approach is based o...
متن کاملExploiting group symmetry in truss topology optimization
We consider semidefinite programming (SDP) formulations of certain truss topology optimization problems, where a lower bound is imposed on the fundamental frequency of vibration of the truss structure. These SDP formulations were introduced in: [M. Ohsaki, K. Fujisawa, N. Katoh and Y. Kanno, Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints, Co...
متن کاملMini-Workshop: Exploiting Symmetry in Optimization
The feasible regions of mathematical optimization models quite often exhibit a high degree of symmetry. In recent years, several groups of researchers have independently worked on algorithmic approaches to exploit such symmetries in a variety of contexts. Many of the techniques that have been developed are related or rely on similar computational tools. The workshop brought together researchers...
متن کاملExploiting Redundancy for Aerial Image Fusion Using Convex Optimization
Image fusion in high-resolution aerial imagery poses a challenging problem due to fine details and complex textures. In particular, color image fusion by using virtual orthographic cameras offers a common representation of overlapping yet perspective aerial images. This paper proposes a variational formulation for a tight integration of redundant image data showing urban environments. We introd...
متن کاملInteger convex minimization by mixed integer linear optimization
Minimizing a convex function over the integral points of a bounded convex set is polynomial in fixed dimension [6]. We provide an alternative, short, and geometrically motivated proof of this result. In particular, we present an oraclepolynomial algorithm based on a mixed integer linear optimization oracle.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2013
ISSN: 0167-6377
DOI: 10.1016/j.orl.2013.02.007