IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v45y2020i1p15-33.html
   My bibliography  Save this article

Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs

Author

Listed:
  • Antonio Frangioni

    (Dipartimento di Informatica, Università di Pisa, 56127 Pisa, Italy;)

  • Claudio Gentile

    (Istituto di Analisi dei Sistemi ed Informatica “Antonio Ruberti,” Consiglio Nazionale delle Ricerche, 00185 Rome, Italy;)

  • James Hungerford

    (RaceTrac Petroleum, Inc., Atlanta, Georgia 30339)

Abstract

We study the problem of decomposing the Hessian matrix of a mixed integer convex quadratic program (MICQP) into the sum of positive semidefinite 2 × 2 matrices. Solving this problem enables the use of perspective reformulation techniques for obtaining strong lower bounds for MICQPs with semicontinuous variables but a nonseparable objective function. An explicit formula is derived for constructing 2 × 2 decompositions when the underlying matrix is weakly scaled diagonally dominant, and necessary and sufficient conditions are given for the decomposition to be unique. For matrices lying outside this class, two exact semidefinite programming approaches and an efficient heuristic are developed for finding approximate decompositions. We present preliminary results on the bound strength of a 2 × 2 perspective reformulation for the portfolio optimization problem, showing that, for some classes of instances, the use of 2 × 2 matrices can significantly improve the quality of the bound with respect to the best previously known approach, although at a possibly high computational cost.

Suggested Citation

  • Antonio Frangioni & Claudio Gentile & James Hungerford, 2020. "Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 15-33, February.
    • Handle: RePEc:inm:ormoor:v:45:y:2020:i:1:p:15-33
    DOI: 10.1287/moor.2018.0969
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/moor.2018.0969
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2018.0969?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. X. Cui & X. Zheng & S. Zhu & X. Sun, 2013. "Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems," Journal of Global Optimization, Springer, vol. 56(4), pages 1409-1423, August.
    2. Xiaojin Zheng & Xiaoling Sun & Duan Li, 2014. "Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 690-703, November.
    3. Antonio Frangioni & Fabio Furini & Claudio Gentile, 2016. "Approximated perspective relaxations: a project and lift approach," Computational Optimization and Applications, Springer, vol. 63(3), pages 705-735, 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. Xiaojin Zheng & Yutong Pan & Zhaolin Hu, 2021. "Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 163-179, January.

    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. Dimitris Bertsimas & Ryan Cory-Wright, 2022. "A Scalable Algorithm for Sparse Portfolio Selection," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1489-1511, May.
    2. Carina Moreira Costa & Dennis Kreber & Martin Schmidt, 2022. "An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 2968-2988, November.
    3. Xiaojin Zheng & Yutong Pan & Zhaolin Hu, 2021. "Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 163-179, January.
    4. Ken Kobayashi & Yuichi Takano & Kazuhide Nakata, 2021. "Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization," Journal of Global Optimization, Springer, vol. 81(2), pages 493-528, October.
    5. Jize Zhang & Tim Leung & Aleksandr Aravkin, 2018. "A Relaxed Optimization Approach for Cardinality-Constrained Portfolio Optimization," Papers 1810.10563, arXiv.org.
    6. N. Krejić & E. H. M. Krulikovski & M. Raydan, 2023. "A Low-Cost Alternating Projection Approach for a Continuous Formulation of Convex and Cardinality Constrained Optimization," SN Operations Research Forum, Springer, vol. 4(4), pages 1-24, December.
    7. Zhi-Long Dong & Fengmin Xu & Yu-Hong Dai, 2020. "Fast algorithms for sparse portfolio selection considering industries and investment styles," Journal of Global Optimization, Springer, vol. 78(4), pages 763-789, December.
    8. Xiaojin Zheng & Yutong Pan & Xueting Cui, 2018. "Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint," Journal of Global Optimization, Springer, vol. 70(4), pages 719-735, April.
    9. Xiaojin Zheng & Xiaoling Sun & Duan Li, 2014. "Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 690-703, November.
    10. Xingmei Li & Yaxian Wang & Qingyou Yan & Xinchao Zhao, 2019. "Uncertain mean-variance model for dynamic project portfolio selection problem with divisibility," Fuzzy Optimization and Decision Making, Springer, vol. 18(1), pages 37-56, March.
    11. Ye Tian & Miao Sun & Zuoliang Ye & Wei Yang, 2016. "Expanded models of the project portfolio selection problem with loss in divisibility," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(8), pages 1097-1107, August.
    12. Janusz Miroforidis, 2021. "Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems," Journal of Global Optimization, Springer, vol. 80(3), pages 617-634, July.
    13. Rujun Jiang & Duan Li, 2019. "Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming," Journal of Global Optimization, Springer, vol. 75(2), pages 461-494, October.

    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:ormoor:v:45:y:2020:i:1:p:15-33. 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.