IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v67y2017i3d10.1007_s10898-016-0436-2.html
   My bibliography  Save this article

An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints

Author

Listed:
  • Cheng Lu

    (North China Electric Power University)

  • Zhibin Deng

    (University of Chinese Academy of Sciences)

  • Qingwei Jin

    (Zhejiang University)

Abstract

In this paper, we propose a branch-and-bound algorithm for finding a global optimal solution for a nonconvex quadratic program with convex quadratic constraints (NQPCQC). We first reformulate NQPCQC by adding some nonconvex quadratic constraints induced by eigenvectors of negative eigenvalues associated with the nonconvex quadratic objective function to Shor’s semidefinite relaxation. Under the assumption of having a bounded feasible domain, these nonconvex quadratic constraints can be further relaxed into linear ones to form a special semidefinite programming relaxation. Then an efficient branch-and-bound algorithm branching along the eigendirections of negative eigenvalues is designed. The theoretic convergence property and the worst-case complexity of the proposed algorithm are proved. Numerical experiments are conducted on several types of quadratic programs to show the efficiency of the proposed method.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jglopt:v:67:y:2017:i:3:d:10.1007_s10898-016-0436-2
    DOI: 10.1007/s10898-016-0436-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-016-0436-2
    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-016-0436-2?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. 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.
    2. Bomze, Immanuel M., 2012. "Copositive optimization – Recent developments and applications," European Journal of Operational Research, Elsevier, vol. 216(3), pages 509-520.
    3. 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)

    Citations

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


    Cited by:

    1. 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.
    2. 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.
    3. 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.
    4. Xiaoli Cen & Yong Xia, 2021. "A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1368-1383, October.

    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. 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.
    3. 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.
    4. 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.
    5. Akihiro Tanaka & Akiko Yoshise, 2018. "LP-based tractable subcones of the semidefinite plus nonnegative cone," Annals of Operations Research, Springer, vol. 265(1), pages 155-182, June.
    6. 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.
    7. 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.
    8. 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.
    9. Andrey Afonin & Roland Hildebrand & Peter J. C. Dickinson, 2021. "The extreme rays of the $$6\times 6$$ 6 × 6 copositive cone," Journal of Global Optimization, Springer, vol. 79(1), pages 153-190, January.
    10. 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.
    11. Immanuel M. Bomze & Bo Peng, 2023. "Conic formulation of QPCCs applied to truly sparse QPs," Computational Optimization and Applications, Springer, vol. 84(3), pages 703-735, April.
    12. Immanuel M. Bomze & Michael Kahr & Markus Leitner, 2021. "Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 301-316, February.
    13. 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.
    14. Wong, Man Hong & Zhang, Shuzhong, 2014. "On distributional robust probability functions and their computations," European Journal of Operational Research, Elsevier, vol. 233(1), pages 23-33.
    15. 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.
    16. Derek Singh & Shuzhong Zhang, 2020. "Distributionally Robust Profit Opportunities," Papers 2006.11279, arXiv.org.
    17. Orizon Pereira Ferreira & Yingchao Gao & Sándor Zoltán Németh & Petra Renáta Rigó, 2024. "Gradient projection method on the sphere, complementarity problems and copositivity," Journal of Global Optimization, Springer, vol. 90(1), pages 1-25, September.
    18. Anwa Zhou & Jinyan Fan, 2015. "Interiors of completely positive cones," Journal of Global Optimization, Springer, vol. 63(4), pages 653-675, December.
    19. O. I. Kostyukova & T. V. Tchemisova, 2022. "On strong duality in linear copositive programming," Journal of Global Optimization, Springer, vol. 83(3), pages 457-480, July.
    20. 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.

    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:67:y:2017:i:3:d:10.1007_s10898-016-0436-2. 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.