SESourour Elloumi
Sourour Elloumi
*This is an algorithmically generated author record based on publicly available information.
Sourour Elloumi has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Alain Billionnet
Laboratoire CEDRIC, École Nationale Supérieure d’Informatique pour l’Industrie et l’Entreprise
3 shared publications - Amélie Lambert
CEDRIC-CNAM, Paris Cedex 03, France
3 shared publications - Angelika Wiegele
Alpen-Adria-Universität Klagenfurt
1 shared publication
Latest Publications
- Open Access
Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
We present algorithm MIQCR-CB that is an advancement of method MIQCR~(Billionnet, Elloumi and Lambert, 2012). MIQCR is a method for solving mixed-integer quadratic programs and works in two phases: the first phase determines an equivalent quadratic formulation with a convex objective function by solving a semidefinite problem $(SDP)$, and, in the second phase, the equivalent formulation is solved by a standard solver. As the reformulation relies on the solution of a large-scale semidefinite program, it is not tractable by existing semidefinite solvers, already for medium sized problems. To surmount this difficulty, we present in MIQCR-CB a subgradient algorithm within a Lagrangian duality framework for solving $(SDP)$ that substantially speeds up the first phase. Moreover, this algorithm leads to a reformulated problem of smaller size than the one obtained by the original MIQCR method which results in a shorter time for solving the second phase. We present extensive computational results to show the efficiency of our algorithm.Open AccessUsing a conic bundle method to accelerate both phases of a quadratic convex reformulation
We present algorithm MIQCR-CB that is an advancement of method MIQCR~(Billionnet, Elloumi and Lambert, 2012). MIQCR is a method for solving mixed-integer quadratic programs and works in two phases: the first phase determines an equivalent quadratic formulation with a convex objective function by solving a semidefinite problem $(SDP)$, and, in the second phase, the equivalent formulation is solved by a standard solver. As the reformulation relies on the solution of a large-scale semidefinite program, it is not tractable by existing semidefinite solvers, already for medium sized problems. To surmount this difficulty, we present in MIQCR-CB a subgradient algorithm within a Lagrangian duality framework for solving $(SDP)$ that substantially speeds up the first phase. Moreover, this algorithm leads to a reformulated problem of smaller size than the one obtained by the original MIQCR method which results in a shorter time for solving the second phase. We present extensive computational results to show the efficiency of our algorithm. - 14 November 2012
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 28 (2) , 376-399
A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- 14 November 2012
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 28 (2) , 376-399
A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- 23 March 2012
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 54 (1) , 141-162
An efficient compact quadratic convex reformulation for general integer quadratic programs
- 23 March 2012
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 54 (1) , 141-162
An efficient compact quadratic convex reformulation for general integer quadratic programs