IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v82y2022i2d10.1007_s10898-021-01071-6.html
   My bibliography  Save this article

Exact SDP relaxations of quadratically constrained quadratic programs with forest structures

Author

Listed:
  • Godai Azuma

    (Tokyo Institute of Technology)

  • Mituhiro Fukuda

    (Tokyo Institute of Technology)

  • Sunyoung Kim

    (Ewha W. University)

  • Makoto Yamashita

    (Tokyo Institute of Technology)

Abstract

We study the exactness of the semidefinite programming (SDP) relaxation of quadratically constrained quadratic programs (QCQPs). With the aggregate sparsity matrix from the data matrices of a QCQP with n variables, the rank and positive semidefiniteness of the matrix are examined. We prove that if the rank of the aggregate sparsity matrix is not less than $$n-1$$ n - 1 and the matrix remains positive semidefinite after replacing some off-diagonal nonzero elements with zeros, then the standard SDP relaxation provides an exact optimal solution for the QCQP under feasibility assumptions. In particular, we demonstrate that QCQPs with forest-structured aggregate sparsity matrix, such as the tridiagonal or arrow-type matrix, satisfy the exactness condition on the rank. The exactness is attained by considering the feasibility of the dual SDP relaxation, the strong duality of SDPs, and a sequence of QCQPs with perturbed objective functions, under the assumption that the feasible region is compact. We generalize our result for a wider class of QCQPs by applying simultaneous tridiagonalization on the data matrices. Moreover, simultaneous tridiagonalization is applied to a matrix pencil so that QCQPs with two constraints can be solved exactly by the SDP relaxation.

Suggested Citation

  • Godai Azuma & Mituhiro Fukuda & Sunyoung Kim & Makoto Yamashita, 2022. "Exact SDP relaxations of quadratically constrained quadratic programs with forest structures," Journal of Global Optimization, Springer, vol. 82(2), pages 243-262, February.
    • Handle: RePEc:spr:jglopt:v:82:y:2022:i:2:d:10.1007_s10898-021-01071-6
    DOI: 10.1007/s10898-021-01071-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-021-01071-6
    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-021-01071-6?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. NESTEROV, Yu. & WOLKOWICZ, Henry & YE, Yinyu, 2000. "Semidefinite programming relaxations of nonconvex quadratic optimization," LIDAM Reprints CORE 1471, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Gábor Pataki, 1998. "On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues," Mathematics of Operations Research, INFORMS, vol. 23(2), pages 339-358, 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. Yuzhou Qiu & E. Alper Yıldırım, 2024. "On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints," Journal of Global Optimization, Springer, vol. 90(2), pages 293-322, October.
    2. Godai Azuma & Mituhiro Fukuda & Sunyoung Kim & Makoto Yamashita, 2023. "Exact SDP relaxations for quadratic programs with bipartite graph structures," Journal of Global Optimization, Springer, vol. 86(3), pages 671-691, July.
    3. Godai Azuma & Sunyoung Kim & Makoto Yamashita, 2025. "Rank-one matrix completion via high-rank matrices in sum-of-squares relaxations," Journal of Global Optimization, Springer, vol. 92(2), pages 321-343, June.
    4. Cheng Lu & Jitao Ma & Zhibin Deng & Wenxun Xing, 2024. "A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem," Journal of Global Optimization, Springer, vol. 88(1), pages 115-137, January.
    5. 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.

    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. Boris Defourny & Ilya O. Ryzhov & Warren B. Powell, 2015. "Optimal Information Blending with Measurements in the L 2 Sphere," Mathematics of Operations Research, INFORMS, vol. 40(4), pages 1060-1088, October.
    2. X. X. Huang & X. Q. Yang & K. L. Teo, 2007. "Lower-Order Penalization Approach to Nonlinear Semidefinite Programming," Journal of Optimization Theory and Applications, Springer, vol. 132(1), pages 1-20, January.
    3. de Klerk, E., 2006. "The Complexity of Optimizing over a Simplex, Hypercube or Sphere : A Short Survey," Discussion Paper 2006-85, Tilburg University, Center for Economic Research.
    4. de Klerk, E. & Laurent, M., 2010. "Error bounds for some semidefinite programming approaches to polynomial minimization on the hypercube," Other publications TiSEM 619d9658-77df-4b5e-9868-0, Tilburg University, School of Economics and Management.
    5. Temadher A. Almaadeed & Saeid Ansary Karbasy & Maziar Salahi & Abdelouahed Hamdi, 2022. "On Indefinite Quadratic Optimization over the Intersection of Balls and Linear Constraints," Journal of Optimization Theory and Applications, Springer, vol. 194(1), pages 246-264, July.
    6. de Klerk, E. & den Hertog, D. & Elfadul, G.E.E., 2005. "On the Complexity of Optimization over the Standard Simplex," Other publications TiSEM 3789955a-6533-4a4e-aca2-6, Tilburg University, School of Economics and Management.
    7. Ting Pong & Henry Wolkowicz, 2014. "The generalized trust region subproblem," Computational Optimization and Applications, Springer, vol. 58(2), pages 273-322, June.
    8. 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.
    9. 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.
    10. Yanjun Wang & Ruizhi Shi & Jianming Shi, 2015. "Duality and robust duality for special nonconvex homogeneous quadratic programming under certainty and uncertainty environment," Journal of Global Optimization, Springer, vol. 62(4), pages 643-659, August.
    11. Stefan Sremac & Fei Wang & Henry Wolkowicz & Lucas Pettersson, 2019. "Noisy Euclidean distance matrix completion with a single missing node," Journal of Global Optimization, Springer, vol. 75(4), pages 973-1002, December.
    12. Madeleine Udell & Stephen Boyd, 2016. "Bounding duality gap for separable problems with linear constraints," Computational Optimization and Applications, Springer, vol. 64(2), pages 355-378, June.
    13. de Klerk, E. & den Hertog, D. & Elabwabi, G., 2008. "On the complexity of optimization over the standard simplex," European Journal of Operational Research, Elsevier, vol. 191(3), pages 773-785, December.
    14. Etienne Klerk, 2008. "The complexity of optimizing over a simplex, hypercube or sphere: a short survey," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 16(2), pages 111-125, June.
    15. Anthony Man-Cho So & Yinyu Ye & Jiawei Zhang, 2008. "A Unified Theorem on SDP Rank Reduction," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 910-920, November.
    16. 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.
    17. de Klerk, E., 2008. "The complexity of optimizing over a simplex, hypercube or sphere : A short survey," Other publications TiSEM 485b6860-cf1d-4cad-97b8-2, Tilburg University, School of Economics and Management.
    18. Samuel Burer & Moshe Dror, 2012. "Newsvendor games: convex optimization of centralized inventory operations," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(3), pages 707-728, October.
    19. Yichuan Ding & Dongdong Ge & Henry Wolkowicz, 2011. "On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming," Mathematics of Operations Research, INFORMS, vol. 36(1), pages 88-104, February.
    20. Luigi Grippo & Laura Palagi & Mauro Piacentini & Veronica Piccialli, 2009. "An unconstrained approach for solving low rank SDP relaxations of {-1,1} quadratic problems," DIS Technical Reports 2009-13, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".

    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:82:y:2022:i:2:d:10.1007_s10898-021-01071-6. 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.