IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v32y2020i1p40-56.html
   My bibliography  Save this article

Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques

Author

Listed:
  • Wei Xia

    (Industrial and Systems Engineering Department, Lehigh University, Bethlehem, Pennsylvania 18015;)

  • Juan C. Vera

    (Tilburg School of Economics and Management, Econometrics and Operations Research, Tilburg University, 5037 AB Tilburg, Netherlands)

  • Luis F. Zuluaga

    (Industrial and Systems Engineering Department, Lehigh University, Bethlehem, Pennsylvania 18015;)

Abstract

We reformulate a (indefinite) quadratic program (QP) as a mixed-integer linear programming (MILP) problem by first reformulating a QP as a linear complementary problem, and then using binary variables and big-M constraints to model its complementary constraints. To obtain such reformulation, we use fundamental results on the solution of perturbed linear systems to impose bounds on the QP’s dual variables without eliminating any of its (globally) optimal primal solutions. Reformulating a nonconvex QP as a MILP problem allows the use of current state-of-the-art MILP solvers to find its global optimal solution. To illustrate this, we compare the performance of this MILP-based solution approach, labeled quadprogIP, with quadprogBB, BARON, and CPLEX. In practice, quadprogIP is shown to typically outperform by orders of magnitude quadprogBB, BARON, and CPLEX on standard QPs. Also, unlike quadprogBB, quadprogIP is able to solve QP instances in which the dual feasible set is unbounded. The MATLAB code quadprogIP and the instances used to perform the reported numerical experiments are publicly available at https://github.com/xiawei918/quadprogIP .

Suggested Citation

  • Wei Xia & Juan C. Vera & Luis F. Zuluaga, 2020. "Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 40-56, January.
    • Handle: RePEc:inm:orijoc:v:32:y:2020:i:1:p:40-56
    DOI: 10.1287/ijoc.2018.0883
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/ijoc.2018.0883
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2018.0883?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Samuel Burer & Dieter Vandenbussche, 2009. "Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound," Computational Optimization and Applications, Springer, vol. 43(2), pages 181-195, June.
    2. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(4), pages 691-705, August.
    3. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(1), pages 225-228, February.
    4. Jing Hu & John Mitchell & Jong-Shi Pang & Bin Yu, 2012. "On linear programs with linear complementarity constraints," Journal of Global Optimization, Springer, vol. 53(1), pages 29-51, May.
    5. Ruth Misener & Christodoulos Floudas, 2013. "GloMIQO: Global mixed-integer quadratic optimizer," Journal of Global Optimization, Springer, vol. 57(1), pages 3-50, September.
    6. Pierre Hansen & Brigitte Jaumard & MichèLe Ruiz & Junjie Xiong, 1993. "Global minimization of indefinite quadratic functions subject to box constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(3), pages 373-392, April.
    7. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(5), pages 879-883, October.
    8. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(6), pages 1195-1198, December.
    9. NESTEROV, Yu., 1998. "Semidefinite relaxation and nonconvex quadratic optimization," LIDAM Reprints CORE 1362, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    10. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(2), pages 411-413, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Francisco Fernández-Navarro & Luisa Martínez-Nieto & Mariano Carbonero-Ruz & Teresa Montero-Romero, 2021. "Mean Squared Variance Portfolio: A Mixed-Integer Linear Programming Formulation," Mathematics, MDPI, vol. 9(3), pages 1-13, January.
    2. Marcia Fampa & Jon Lee, 2021. "Convexification of bilinear forms through non-symmetric lifting," Journal of Global Optimization, Springer, vol. 80(2), pages 287-305, June.
    3. Riley Badenbroek & Etienne Klerk, 2022. "Simulated Annealing for Convex Optimization: Rigorous Complexity Analysis and Practical Perspectives," Journal of Optimization Theory and Applications, Springer, vol. 194(2), pages 465-491, August.
    4. Riley Badenbroek & Etienne de Klerk, 2022. "An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1115-1125, March.
    5. de Klerk, Etienne & Badenbroek, Riley, 2022. "Simulated annealing with hit-and-run for convex optimization: complexity analysis and practical perspectives," Other publications TiSEM 323b4588-65e0-4889-a555-9, Tilburg University, School of Economics and Management.
    6. Jacek Gondzio & E. Alper Yıldırım, 2021. "Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations," Journal of Global Optimization, Springer, vol. 81(2), pages 293-321, October.
    7. Bomze, Immanuel M. & Gabl, Markus, 2023. "Optimization under uncertainty and risk: Quadratic and copositive approaches," European Journal of Operational Research, Elsevier, vol. 310(2), pages 449-476.
    8. G. Liuzzi & M. Locatelli & V. Piccialli & S. Rass, 2021. "Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems," Computational Optimization and Applications, Springer, vol. 79(3), pages 561-599, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hezhi Luo & Xiaodi Bai & Jiming Peng, 2019. "Enhancing Semidefinite Relaxation for Quadratically Constrained Quadratic Programming via Penalty Methods," Journal of Optimization Theory and Applications, Springer, vol. 180(3), pages 964-992, March.
    2. Ramtin Madani & Mohsen Kheirandishfard & Javad Lavaei & Alper Atamtürk, 2020. "Penalized semidefinite programming for quadratically-constrained quadratic optimization," Journal of Global Optimization, Springer, vol. 78(3), pages 423-451, November.
    3. X. Zheng & X. Sun & D. Li, 2011. "Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations," Journal of Global Optimization, Springer, vol. 50(4), pages 695-712, August.
    4. Yakut, Oguz, 2021. "Implementation of hydraulically driven barrel shooting control by utilizing artificial neural networks," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 190(C), pages 1206-1223.
    5. X. Qin & G. Huang, 2009. "An Inexact Chance-constrained Quadratic Programming Model for Stream Water Quality Management," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 23(4), pages 661-695, March.
    6. Md. Yousuf Gazi & Khandakar Tahmida Tafhim, 2019. "Investigation of Heavy-mineral Deposits Using Multispectral Satellite Imagery in the Eastern Coastal Margin of Bangladesh," Earth Sciences Malaysia (ESMY), Zibeline International Publishing, vol. 3(2), pages 16-22, October.
    7. Billionnet, Alain, 2011. "Solving the probabilistic reserve selection problem," Ecological Modelling, Elsevier, vol. 222(3), pages 546-554.
    8. Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
    9. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.
    10. Eichengreen, Barry & Kletzer, Kenneth & Mody, Ashoka, 2003. "Crisis Resolution: Next Steps," Santa Cruz Center for International Economics, Working Paper Series qt4cj974r4, Center for International Economics, UC Santa Cruz.
    11. Tansel, Aysit & Karao?lan, Deniz, 2016. "The Causal Effect of Education on Health Behaviors: Evidence from Turkey," IZA Discussion Papers 10020, Institute of Labor Economics (IZA).
    12. Di Feng & Bettina Klaus, 2022. "Preference revelation games and strict cores of multiple‐type housing market problems," International Journal of Economic Theory, The International Society for Economic Theory, vol. 18(1), pages 61-76, March.
    13. Anna Scherbina, 2021. "Assessing the Optimality of a COVID Lockdown in the United States," Economics of Disasters and Climate Change, Springer, vol. 5(2), pages 177-201, July.
    14. John McKay, 2005. "How Significant and Effective are North Korea's "Market Reforms"?," Global Economic Review, Taylor & Francis Journals, vol. 34(1), pages 83-97.
    15. Timothy K.M. Beatty & Erling Røed Larsen & Dag Einar Sommervoll, 2005. "Measuring the Price of Housing Consumption for Owners in the CPI," Discussion Papers 427, Statistics Norway, Research Department.
    16. Marco Bianchi & Carlos Tapia & Ikerne del Valle, 2020. "Monitoring domestic material consumption at lower territorial levels: A novel data downscaling method," Journal of Industrial Ecology, Yale University, vol. 24(5), pages 1074-1087, October.
    17. Sonmez, Tayfun & Utku Unver, M., 2005. "House allocation with existing tenants: an equivalence," Games and Economic Behavior, Elsevier, vol. 52(1), pages 153-185, July.
    18. Juarez, Ruben, 2013. "Group strategyproof cost sharing: The role of indifferences," Games and Economic Behavior, Elsevier, vol. 82(C), pages 218-239.
    19. Velloso, Helvia & Vézina, François & Bustillo, Inés, 2006. "The Canadian retirement income system," Documentos de Proyectos 3682, Naciones Unidas Comisión Económica para América Latina y el Caribe (CEPAL).
    20. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orijoc:v:32:y:2020:i:1:p:40-56. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.