IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v85y2023i3d10.1007_s10898-022-01224-1.html
   My bibliography  Save this article

New bounds for nonconvex quadratically constrained quadratic programming

Author

Listed:
  • Moslem Zamani

    (Tilburg University)

Abstract

In this paper, we study some bounds for nonconvex quadratically constrained quadratic programs (QCQPs). We propose two types of bounds for QCQPs, quadratic and cubic bounds. We use affine functions as Lagrange multipliers for quadratic bounds. We demonstrate that most semidefinite relaxations can be obtained as the dual of a quadratic bound. In addition, we study bounds obtained by changing the ground set. For cubic bounds, in addition to affine multipliers we employ quadratic functions. We provide a comparison between the proposed cubic bound and typical bounds for standard quadratic programs. Moreover, we report comparison results of some quadratic and cubic bounds.

Suggested Citation

  • Moslem Zamani, 2023. "New bounds for nonconvex quadratically constrained quadratic programming," Journal of Global Optimization, Springer, vol. 85(3), pages 595-613, March.
    • Handle: RePEc:spr:jglopt:v:85:y:2023:i:3:d:10.1007_s10898-022-01224-1
    DOI: 10.1007/s10898-022-01224-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-022-01224-1
    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-022-01224-1?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. Moslem Zamani, 2019. "A new algorithm for concave quadratic programming," Journal of Global Optimization, Springer, vol. 75(3), pages 655-681, November.
    2. A. Sutou & Y. Dai, 2002. "Global Optimization Approach to Unequal Global Optimization Approach to Unequal Sphere Packing Problems in 3D," Journal of Optimization Theory and Applications, Springer, vol. 114(3), pages 671-694, September.
    3. Hoang Tuy, 2016. "Convex Analysis and Global Optimization," Springer Optimization and Its Applications, Springer, edition 2, number 978-3-319-31484-6, June.
    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. Mohand Bentobache & Mohamed Telli & Abdelkader Mokhtari, 2022. "New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming," Journal of Global Optimization, Springer, vol. 82(4), pages 659-689, April.
    2. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    3. Welington Oliveira, 2019. "Proximal bundle methods for nonsmooth DC programming," Journal of Global Optimization, Springer, vol. 75(2), pages 523-563, October.
    4. Peiping Shen & Kaimin Wang & Ting Lu, 2020. "Outer space branch and bound algorithm for solving linear multiplicative programming problems," Journal of Global Optimization, Springer, vol. 78(3), pages 453-482, November.
    5. W. Ackooij & S. Demassey & P. Javal & H. Morais & W. Oliveira & B. Swaminathan, 2021. "A bundle method for nonsmooth DC programming with application to chance-constrained problems," Computational Optimization and Applications, Springer, vol. 78(2), pages 451-490, March.
    6. Takahito Kuno, 2022. "A revision of the rectangular algorithm for a class of DC optimization problems," Journal of Global Optimization, Springer, vol. 83(2), pages 187-200, June.
    7. Bo Wen & Xiaojun Chen & Ting Kei Pong, 2018. "A proximal difference-of-convex algorithm with extrapolation," Computational Optimization and Applications, Springer, vol. 69(2), pages 297-324, March.
    8. Hifi, Mhand & Yousef, Labib, 2019. "A local search-based method for sphere packing problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 482-500.
    9. Nguyen Dong Yen, 2023. "Book review on “Convex Analysis and Beyond. Volume I: Basic Theory”, a monograph by Boris S. Mordukhovich and Nguyen Mau Nam," Journal of Global Optimization, Springer, vol. 85(1), pages 251-255, January.
    10. Riccardo Cambini, 2020. "Underestimation functions for a rank-two partitioning method," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 43(2), pages 465-489, December.
    11. Tianxiang Liu & Ting Kei Pong & Akiko Takeda, 2019. "A refined convergence analysis of $$\hbox {pDCA}_{e}$$ pDCA e with applications to simultaneous sparse recovery and outlier detection," Computational Optimization and Applications, Springer, vol. 73(1), pages 69-100, May.
    12. Andreas Fischer & Igor Litvinchev & Tetyana Romanova & Petro Stetsyuk & Georgiy Yaskov, 2023. "Quasi-Packing Different Spheres with Ratio Conditions in a Spherical Container," Mathematics, MDPI, vol. 11(9), pages 1-19, April.
    13. Yue Zhou-Kangas & Kaisa Miettinen, 2019. "Decision making in multiobjective optimization problems under uncertainty: balancing between robustness and quality," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 391-413, June.
    14. Stoyan, Yu. & Chugay, A., 2009. "Packing cylinders and rectangular parallelepipeds with distances between them into a given region," European Journal of Operational Research, Elsevier, vol. 197(2), pages 446-455, September.
    15. Shen, Peiping & Zhu, Zeyi & Chen, Xiao, 2019. "A practicable contraction approach for the sum of the generalized polynomial ratios problem," European Journal of Operational Research, Elsevier, vol. 278(1), pages 36-48.
    16. Hatami-Marbini, Adel & Arabmaldar, Aliasghar, 2021. "Robustness of Farrell cost efficiency measurement under data perturbations: Evidence from a US manufacturing application," European Journal of Operational Research, Elsevier, vol. 295(2), pages 604-620.
    17. Felipe Serrano & Robert Schwarz & Ambros Gleixner, 2020. "On the relation between the extended supporting hyperplane algorithm and Kelley’s cutting plane algorithm," Journal of Global Optimization, Springer, vol. 78(1), pages 161-179, September.
    18. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2020. "Essentials of numerical nonsmooth optimization," 4OR, Springer, vol. 18(1), pages 1-47, March.
    19. S. P. Li & Ka-Lok Ng, 2003. "Study Of The Unequal Spheres Packing Problem: An Application To Radiosurgery Treatment," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 14(06), pages 815-823.
    20. Peiping Shen & Dianxiao Wu & Kaimin Wang, 2023. "Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound," Journal of Global Optimization, Springer, vol. 86(2), pages 303-321, June.

    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:85:y:2023:i:3:d:10.1007_s10898-022-01224-1. 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.