IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v73y2019i2d10.1007_s10898-018-0726-y.html
   My bibliography  Save this article

A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming

Author

Listed:
  • Cheng Lu

    (North China Electric Power University)

  • Zhibin Deng

    (Chinese Academy of Sciences)

  • Jing Zhou

    (Zhejiang University of Technology)

  • Xiaoling Guo

    (China University of Mining and Technology)

Abstract

In this paper, we design an eigenvalue decomposition based branch-and-bound algorithm for finding global solutions of quadratically constrained quadratic programming (QCQP) problems. The hardness of nonconvex QCQP problems roots in the nonconvex components of quadratic terms, which are represented by the negative eigenvalues and the corresponding eigenvectors in the eigenvalue decomposition. For certain types of QCQP problems, only very few eigenvectors, defined as sensitive-eigenvectors, determine the relaxation gaps. We propose a semidefinite relaxation based branch-and-bound algorithm to solve QCQP. The proposed algorithm, which branches on the directions of the sensitive-eigenvectors, is very efficient for solving certain types of QCQP problems.

Suggested Citation

  • Cheng Lu & Zhibin Deng & Jing Zhou & Xiaoling Guo, 2019. "A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming," Journal of Global Optimization, Springer, vol. 73(2), pages 371-388, February.
    • Handle: RePEc:spr:jglopt:v:73:y:2019:i:2:d:10.1007_s10898-018-0726-y
    DOI: 10.1007/s10898-018-0726-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-018-0726-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-018-0726-y?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Cheng Lu & Zhibin Deng & Qingwei Jin, 2017. "An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints," Journal of Global Optimization, Springer, vol. 67(3), pages 475-493, March.
    2. Jos F. Sturm & Shuzhong Zhang, 2003. "On Cones of Nonnegative Quadratic Functions," Mathematics of Operations Research, INFORMS, vol. 28(2), pages 246-267, May.
    Full references (including those not matched with items on IDEAS)

    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. Bo Zhang & YueLin Gao & Xia Liu & XiaoLi Huang, 2023. "Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems," Journal of Global Optimization, Springer, vol. 86(1), pages 61-92, May.
    2. Shinji Yamada & Akiko Takeda, 2018. "Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization," Journal of Global Optimization, Springer, vol. 71(2), pages 313-339, June.
    3. Ben-Tal, A. & den Hertog, D., 2011. "Immunizing Conic Quadratic Optimization Problems Against Implementation Errors," Discussion Paper 2011-060, Tilburg University, Center for Economic Research.
    4. Xinzhen Zhang & Chen Ling & Liqun Qi, 2011. "Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints," Journal of Global Optimization, Springer, vol. 49(2), pages 293-311, February.
    5. Bo Zhang & YueLin Gao & Xia Liu & XiaoLi Huang, 2022. "An Outcome-Space-Based Branch-and-Bound Algorithm for a Class of Sum-of-Fractions Problems," Journal of Optimization Theory and Applications, Springer, vol. 192(3), pages 830-855, March.
    6. 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.
    7. Immanuel Bomze & Werner Schachinger & Gabriele Uchida, 2012. "Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimization," Journal of Global Optimization, Springer, vol. 52(3), pages 423-445, March.
    8. Jing Zhou & Shu-Cherng Fang & Wenxun Xing, 2017. "Conic approximation to quadratic optimization with linear complementarity constraints," Computational Optimization and Applications, Springer, vol. 66(1), pages 97-122, January.
    9. Li, Xiaobo & Natarajan, Karthik & Teo, Chung-Piaw & Zheng, Zhichao, 2014. "Distributionally robust mixed integer linear programs: Persistency models with applications," European Journal of Operational Research, Elsevier, vol. 233(3), pages 459-473.
    10. Immanuel Bomze & Markus Gabl, 2021. "Interplay of non-convex quadratically constrained problems with adjustable robust optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(1), pages 115-151, February.
    11. M. Locatelli, 2023. "KKT-based primal-dual exactness conditions for the Shor relaxation," Journal of Global Optimization, Springer, vol. 86(2), pages 285-301, June.
    12. Amir Beck & Dror Pan, 2017. "A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints," Journal of Global Optimization, Springer, vol. 69(2), pages 309-342, October.
    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.
    14. Sheng-Long Hu & Zheng-Hai Huang, 2012. "Theorems of the Alternative for Inequality Systems of Real Polynomials," Journal of Optimization Theory and Applications, Springer, vol. 154(1), pages 1-16, July.
    15. Wenbao Ai & Yongwei Huang & Shuzhong Zhang, 2008. "On the Low Rank Solutions for Linear Matrix Inequalities," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 965-975, November.
    16. Yu, Pengfei & Gao, Ruotian & Xing, Wenxun, 2021. "Maximizing perturbation radii for robust convex quadratically constrained quadratic programs," European Journal of Operational Research, Elsevier, vol. 293(1), pages 50-64.
    17. Meijia Yang & Shu Wang & Yong Xia, 2022. "Toward Nonquadratic S-Lemma: New Theory and Application in Nonconvex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 194(1), pages 353-363, July.
    18. Deng, Zhibin & Fang, Shu-Cherng & Jin, Qingwei & Xing, Wenxun, 2013. "Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme," European Journal of Operational Research, Elsevier, vol. 229(1), pages 21-28.
    19. Li Chen & Simai He & Shuzhong Zhang, 2011. "Tight Bounds for Some Risk Measures, with Applications to Robust Portfolio Selection," Operations Research, INFORMS, vol. 59(4), pages 847-865, August.
    20. Derek Singh & Shuzhong Zhang, 2020. "Distributionally Robust Profit Opportunities," Papers 2006.11279, arXiv.org.

    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:spr:jglopt:v:73:y:2019:i:2:d:10.1007_s10898-018-0726-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.