Abstract
The sequential convex MINLP (SC-MINLP) technique is a solution method for nonconvex mixed-integer nonlinear problems (MINLPs) where the nonconvexities are separable. It is based on solving a sequence of convex MINLPs which trade a better and better relaxation of the nonconvex part of the problem with the introduction of more and more piecewise-linear nonconvex terms, and therefore binary variables. The convex MINLPs are obtained by partitioning the domain of each separable nonconvex term in the intervals in which it is convex and those in which it is concave. In the former, the term is left in its original form, while in the latter it is piecewise-linearized. Since each interval corresponds to a semi-continuous variable, we propose to modify the convex terms using the Perspective Reformulation technique to strengthen the bounds. We show by means of experimental results on different classes of instances that doing so significantly decreases the solution time of the convex MINLPs, which is the most time consuming part of the approach, and has therefore the potential to improving the overall effectiveness of SC-MINLP.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bonami, P., Lee, J.: Bonmin users’ manual. Technical Report (June 2006)
Castro, J., Frangioni, A., Gentile, C.: Perspective reformulations of the CTA problem with \(l_2\) distances. Oper. Res. 62(4), 891–909 (2014)
D’Ambrosio, C., Lee, J., Wächter, A.: A global-optimization algorithm for mixed-integer nonlinear programs having separable non-convexity. In: Algorithms—ESA 2009. LNCS, vol. 5757, pp. 107–118. Springer, Berlin (2009)
D’Ambrosio, C., Lee, J., Wächter, A.: An algorithmic framework for MINLP with separable non-convexity. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming. The IMA Volumes in Mathematics and Its Applications, vol. 154, pp. 315–347. Springer, New York (2012)
Frangioni, A., Furini, F., Gentile, C.: Approximated perspective relaxations: a project and lift approach. Comput. Optim. Appl. 63(3), 705–735 (2016)
Frangioni, A., Furini, F., Gentile, C.: Improving the approximated projected perspective reformulation by dual information. Oper. Res. Lett. 45, 519–524 (2017)
Frangioni, A., Gentile, C.: Perspective cuts for a class of convex 0–1 mixed integer programs. Math. Program. 106(2), 225–236 (2006)
Frangioni, A., Gentile, C., Grande, E., Pacifici, A.: Projected perspective reformulations with applications in design problems. Oper. Res. 59(5), 1225–1232 (2011)
Frangioni, A., Gorgone, E.: A library for continuous convex separable quadratic knapsack problems. Eur. J. Oper. Res. 229(1), 37–40 (2013)
Gleixner, A., Eifler, L., Gally, T., Gamrath, G., Gemander, P., Gottwald, R.L., Hendel, G., Hojny, C., Koch, T., Miltenberger, M., Müller, B., Pfetsch, M.E., Puchert, C., Rehfeldt, D., Schlösser, F., Serrano, F., Shinano, Y., Viernickel, J.M., Vigerske, S., Weninger, D., Witt, J.T., Witzig, J.: The SCIP optimization suite 5.0. Technical Report 17-61, ZIB, Takustr.7, 14195 Berlin (2017)
IBM: ILOG CPLEX 12.7 User’s Manual. IBM (2016)
Mahajan, A., Leyffer, S., Linderoth, J., Luedtke, J., Munson, T.: Minotaur: A mixed-integer nonlinear optimization toolkit. Optimization Online 6275 (2017)
Acknowledgements
The second and the third authors are partially supported by the Project MIUR-PRIN 2015B5F27W. This paper has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 764759.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
D’Ambrosio, C., Frangioni, A. & Gentile, C. Strengthening the sequential convex MINLP technique by perspective reformulations. Optim Lett 13, 673–684 (2019). https://doi.org/10.1007/s11590-018-1360-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-018-1360-9