Results 1  10
of
23
Reformulations in mathematical programming: Automatic symmetry detection and exploitation
 Mathematical Programming
"... symmetrydetection andexploitation ..."
(Show Context)
Reformulations in mathematical programming: Symmetry
 Mathematical Programming
, 2009
"... If a mathematical program (be it linear or nonlinear) has many symmetric optima, solving it via BranchandBound techniques often yields search trees of disproportionate sizes; thus, finding and exploiting symmetries is an important task. We propose a method for: (a) automatically finding the formul ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
If a mathematical program (be it linear or nonlinear) has many symmetric optima, solving it via BranchandBound techniques often yields search trees of disproportionate sizes; thus, finding and exploiting symmetries is an important task. We propose a method for: (a) automatically finding the formulation group of any given MixedInteger Nonlinear Program, and (b) reformulating the problem so that some symmetric solutions become infeasible. The reformulated problem can then be solved via standard BranchandBound codes such as CPLEX (for linear programs) and Couenne (for nonlinear programs). Our computational results include formulation group tables for the MIPLib3, MIPLib2003, GlobalLib and MINLPLib instance libraries, solution tables for some instances in the aforementioned libraries, and a theoretical and computational study of the symmetries of the Kissing Number Problem. 1
On convex relaxations of quadrilinear terms
, 2009
"... The best known method to find exact or at least εapproximate solutions to polynomial programming problems is the spatial BranchandBound algorithm, which rests on computing lower bounds to the value of the objective function to be minimized on each region that it explores. These lower bounds are o ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(Show Context)
The best known method to find exact or at least εapproximate solutions to polynomial programming problems is the spatial BranchandBound algorithm, which rests on computing lower bounds to the value of the objective function to be minimized on each region that it explores. These lower bounds are often computed by solving convex relaxations of the original program. Although convex envelopes are explicitly known (via linear inequalities) for bilinear and trilinear terms on arbitrary boxes, such a description is unknown, in general, for multilinear terms of higher order. In this paper, we study convex relaxations of quadrilinear terms. We exploit associativity to rewrite such terms as products of bilinear and trilinear terms. Using a general technique, we establish that, any relaxation for klinear terms that employs a successive use of relaxing bilinear terms (via the bilinear convex envelope) can be improved by employing instead a relaxation of a trilinear term (via the trilinear convex envelope). We present a computational analysis which helps establish which relaxations are strictly tighter, and we apply our findings to two wellstudied applications: the Molecular Distance Geometry Problem and the HartreeFock Problem.
Symmetry in mathematical programming
 MIXED INTEGER NONLINEAR PROGRAMMING. VOLUME IMA
"... Symmetry is mainly exploited in mathematical programming in order to reduce the computation times of enumerative algorithms. The most widespread approach rests on: (a) finding symmetries in the problem instance; (b) reformulating the problem so that it does not allow some of the symmetric optima; ( ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
Symmetry is mainly exploited in mathematical programming in order to reduce the computation times of enumerative algorithms. The most widespread approach rests on: (a) finding symmetries in the problem instance; (b) reformulating the problem so that it does not allow some of the symmetric optima; (c) solving the modified problem. Sometimes (b) and (c) are performed concurrently: the solution algorithm generates a sequence of subproblems, some of which are recognized to be symmetrically equivalent and either discarded or treated differently. We review symmetrybased analyses and methods for Linear Programming, Integer Linear Programming, MixedInteger Linear Programming and Semidefinite Programming. We then discuss a method (introduced in [35]) for automatically detecting symmetries of general (nonconvex) Nonlinear and MixedInteger Nonlinear Programming problems and a reformulation based on adjoining symmetry breaking constraints to the original formulation. We finally present a new theoretical and computational study of the formulation symmetries of the Kissing Number Problem.
Experiments with a Feasibility Pump approach for nonconvex MINLPs
 SYMPOSIUM ON EXPERIMENTAL AND EFFICIENT ALGORITHMS
, 2010
"... We present a new Feasibility Pump algorithm tailored for nonconvex Mixed Integer Nonlinear Programming problems. Differences with the previously proposed Feasibility Pump algorithms and difficulties arising from nonconvexities in the models are extensively discussed. The main methodological innovati ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We present a new Feasibility Pump algorithm tailored for nonconvex Mixed Integer Nonlinear Programming problems. Differences with the previously proposed Feasibility Pump algorithms and difficulties arising from nonconvexities in the models are extensively discussed. The main methodological innovations of this variant are: (a) the first subproblem is a nonconvex continuous Nonlinear Program, which is solved using global optimization techniques; (b) the solution method for the second subproblem is complemented by a tabu list. We exhibit computational results showing the good performance of the algorithm on instances taken from the MINLPLib.
Feasibilitybased bounds tightening via fixed points
"... Abstract. The search tree size of the spatial BranchandBound algorithm for MixedInteger Nonlinear Programming depends on many factors, one of which is the width of the variable ranges at every tree node. A range reduction technique often employed is called Feasibility Based Bounds Tightening, whi ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
Abstract. The search tree size of the spatial BranchandBound algorithm for MixedInteger Nonlinear Programming depends on many factors, one of which is the width of the variable ranges at every tree node. A range reduction technique often employed is called Feasibility Based Bounds Tightening, which is known to be practically fast, and is thus deployed at every node of the search tree. From time to time, however, this technique fails to converge to its limit point in finite time, thereby slowing the whole BranchandBound search considerably. In this paper we propose a polynomial time method, based on solving a linear program, for computing the limit point of the Feasibility Based Bounds Tightening algorithm applied to linear equality and inequality constraints. Keywords: global optimization, MINLP, spatial BranchandBound, range reduction, constraint programming. 1
The ReformulationOptimization Software Engine
"... Most optimization software performs numerical computation, in the sense that the main interest is to find numerical values to assign to the decision variables, e.g. a solution to an optimization problem. In mathematical programming, however, a considerable amount of symbolic transformation is essen ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Most optimization software performs numerical computation, in the sense that the main interest is to find numerical values to assign to the decision variables, e.g. a solution to an optimization problem. In mathematical programming, however, a considerable amount of symbolic transformation is essential to solving difficult optimization problems, e.g. relaxation or decomposition techniques. This step is usually carried out by hand, involves human ingenuity, and often constitutes the “theoretical contribution” of some research papers. We describe a ReformulationOptimization Software Engine (ROSE) for performing (automatic) symbolic computation on mathematical programming formulations.
Experiments with a feasibility pump approach for nonconvex MINLPs
 Symposium on Experimental Algorithms, volume 6049 of LNCS
, 2010
"... Abstract. We present a new Feasibility Pump algorithm tailored for nonconvex Mixed Integer Nonlinear Programming problems. Differences with the previously proposed Feasibility Pump algorithms and difficulties arising from nonconvexities in the models are extensively discussed. The main methodologica ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Abstract. We present a new Feasibility Pump algorithm tailored for nonconvex Mixed Integer Nonlinear Programming problems. Differences with the previously proposed Feasibility Pump algorithms and difficulties arising from nonconvexities in the models are extensively discussed. The main methodological innovations of this variant are: (a) the first subproblem is a nonconvex continuous Nonlinear Program, which is solved using global optimization techniques; (b) the solution method for the second subproblem is complemented by a tabu list. We exhibit computational results showing the good performance of the algorithm on instances taken from the MINLPLib. 1
Comparison of convex relaxations of quadrilinear terms
"... In this paper we compare four different ways to compute a convex linear relaxation of a quadrilinear monomial on a box, analyzing their relative tightness. We computationally compare the quality of the relaxations, and we provide a general theorem on pairwisecomparison of relaxation strength, which ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
In this paper we compare four different ways to compute a convex linear relaxation of a quadrilinear monomial on a box, analyzing their relative tightness. We computationally compare the quality of the relaxations, and we provide a general theorem on pairwisecomparison of relaxation strength, which applies to some of our pairs of relaxations for quadrilinear monomials. Our results can be used to configure a spatial BranchandBound global optimization algorithm. We apply our results to the Molecular Distance Geometry Problem, demonstrating the usefulness of the present study. quadrilinear; convex relaxation; reformulation; global optimization, spatial Branch