IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v49y2011i2p293-311.html

Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints

Author

Listed:
  • Xinzhen Zhang

  • Chen Ling

  • Liqun Qi

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jglopt:v:49:y:2011:i:2:p:293-311
    DOI: 10.1007/s10898-010-9545-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-010-9545-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-010-9545-5?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Jos F. Sturm & Shuzhong Zhang, 2003. "On Cones of Nonnegative Quadratic Functions," Mathematics of Operations Research, INFORMS, vol. 28(2), pages 246-267, May.
    2. Yongwei Huang & Shuzhong Zhang, 2007. "Complex Matrix Decomposition and Quadratic Programming," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 758-768, August.
    3. 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.
    4. 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. Haibin Chen & Hongjin He & Yiju Wang & Guanglu Zhou, 2022. "An efficient alternating minimization method for fourth degree polynomial optimization," Journal of Global Optimization, Springer, vol. 82(1), pages 83-103, January.
    2. Shigui Li & Linzhang Lu & Xing Qiu & Zhen Chen & Delu Zeng, 2024. "Tighter bound estimation for efficient biquadratic optimization over unit spheres," Journal of Global Optimization, Springer, vol. 90(2), pages 323-353, October.
    3. Yuning Yang & Qingzhi Yang & Liqun Qi, 2014. "Approximation Bounds for Trilinear and Biquadratic Optimization Problems Over Nonconvex Constraints," Journal of Optimization Theory and Applications, Springer, vol. 163(3), pages 841-858, December.
    4. Ke Hou & Anthony Man-Cho So, 2014. "Hardness and Approximation Results for L p -Ball Constrained Homogeneous Polynomial Optimization Problems," Mathematics of Operations Research, INFORMS, vol. 39(4), pages 1084-1108, November.

    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. 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.
    2. 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.
    3. Chang He & Bo Jiang & Xihua Zhu, 2023. "Quaternion matrix decomposition and its theoretical implications," Journal of Global Optimization, Springer, vol. 87(2), pages 741-758, November.
    4. 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.
    5. Yongwei Huang & Shuzhong Zhang, 2007. "Complex Matrix Decomposition and Quadratic Programming," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 758-768, August.
    6. C. J. Argue & Fatma Kılınç-Karzan & Alex L. Wang, 2023. "Necessary and Sufficient Conditions for Rank-One-Generated Cones," Mathematics of Operations Research, INFORMS, vol. 48(1), pages 100-126, February.
    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. S. Fallahi & M. Salahi, 2017. "On the complex fractional quadratic optimization with a quadratic constraint," OPSEARCH, Springer;Operational Research Society of India, vol. 54(1), pages 94-106, March.
    10. Roozbeh Abolpour & Mohammad Reza Hesamzadeh & Maryam Dehghani, 2025. "Nonconvex Quadratically-Constrained Feasibility Problems: An Inside-Ellipsoids Outside-Sphere Model," Journal of Optimization Theory and Applications, Springer, vol. 204(2), pages 1-29, February.
    11. 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.
    12. 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.
    13. 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".
    14. Guanglin Xu & Samuel Burer, 2018. "A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming," Computational Management Science, Springer, vol. 15(1), pages 111-134, January.
    15. Jos F. Sturm & Shuzhong Zhang, 2003. "On Cones of Nonnegative Quadratic Functions," Mathematics of Operations Research, INFORMS, vol. 28(2), pages 246-267, May.
    16. Im, Haesol & Wolkowicz, Henry, 2023. "Revisiting degeneracy, strict feasibility, stability, in linear programming," European Journal of Operational Research, Elsevier, vol. 310(2), pages 495-510.
    17. Areesh Mittal & Grani A. Hanasusanto, 2022. "Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming," Operations Research, INFORMS, vol. 70(5), pages 2867-2882, September.
    18. 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.
    19. 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.
    20. Moslem Zamani, 2019. "A new algorithm for concave quadratic programming," Journal of Global Optimization, Springer, vol. 75(3), pages 655-681, November.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    Statistics

    Access and download statistics

    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:49:y:2011:i:2:p:293-311. 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.