A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes

[1]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[2]  Ignacio E. Grossmann,et al.  Computational implementation of non-linear convex hull reformulation , 2007, Comput. Chem. Eng..

[3]  Stephen J. Wright,et al.  Efficient schemes for robust IMRT treatment planning , 2006, Physics in medicine and biology.

[4]  Claudio Gentile,et al.  Solving unit commitment problems with general ramp constraints , 2008 .

[5]  George L. Nemhauser,et al.  A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs , 2008, INFORMS J. Comput..

[6]  Sinan Gürel,et al.  A strong conic quadratic reformulation for machine-job assignment with controllable processing times , 2009, Oper. Res. Lett..

[7]  C. Gentile,et al.  Tighter Approximated MILP Formulations for Unit Commitment Problems , 2009, IEEE Transactions on Power Systems.

[8]  Jeff T. Linderoth,et al.  RELAXATION OF MINLPS WITH INDICATOR VARIABLES , 2007 .

[9]  I. Grossmann,et al.  An LP/NLP based branch and bound algorithm for convex MINLP optimization problems , 1992 .

[10]  Claudio Gentile,et al.  Perspective cuts for a class of convex 0–1 mixed integer programs , 2006, Math. Program..

[11]  Juan M. Zamora,et al.  A global MINLP optimization algorithm for the synthesis of heat exchanger networks with no stream splits , 1998 .

[12]  G. Mitra,et al.  Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints , 2001 .

[13]  Sanjay Mehrotra,et al.  A branch-and-cut method for 0-1 mixed convex programming , 1999, Math. Program..

[14]  Sebastián Ceria,et al.  Convex programming for disjunctive convex optimization , 1999, Math. Program..

[15]  Claudio Gentile,et al.  SDP diagonalizations and perspective cuts for a class of nonseparable MIQP , 2007, Oper. Res. Lett..

[16]  Nikolaos V. Sahinidis,et al.  Semidefinite Relaxations of Fractional Programs via Novel Convexification Techniques , 2001, J. Glob. Optim..

[17]  Ignacio E. Grossmann,et al.  An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1987, Math. Program..

[18]  Claudio Gentile,et al.  Perspective cuts for 0-1 mixed integer programs , 2002 .