IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v154y2012i1d10.1007_s10957-012-9993-9.html
   My bibliography  Save this article

Theorems of the Alternative for Inequality Systems of Real Polynomials

Author

Listed:
  • Sheng-Long Hu

    (Tianjin University
    The Hong Kong Polytechnic University)

  • Zheng-Hai Huang

    (Tianjin University)

Abstract

In this paper, we establish theorems of the alternative for inequality systems of real polynomials. For the real quadratic inequality system, we present two new results on the matrix decomposition, by which we establish two theorems of the alternative for the inequality system of three quadratic polynomials under an assumption that at least one of the involved forms be negative semidefinite. We also extend a theorem of the alternative to the case with a regular cone. For the inequality system of higher degree real polynomials, defined by even order tensors, a theorem of the alternative for the inequality system of two higher degree polynomials is established under suitable assumptions. As a byproduct, we give an equivalence result between two statements involving two higher degree polynomials. Based on this result, we investigate the optimality condition of a class of polynomial optimization problems under suitable assumptions.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joptap:v:154:y:2012:i:1:d:10.1007_s10957-012-9993-9
    DOI: 10.1007/s10957-012-9993-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-012-9993-9
    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/s10957-012-9993-9?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. 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.
    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.
    3. B. T. Polyak, 1998. "Convexity of Quadratic Transformations and Its Use in Control and Optimization," Journal of Optimization Theory and Applications, Springer, vol. 99(3), pages 553-583, December.
    4. 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.
    5. Yongwei Huang & Shuzhong Zhang, 2007. "Complex Matrix Decomposition and Quadratic Programming," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 758-768, August.
    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. M. Ruiz Galán, 2017. "A theorem of the alternative with an arbitrary number of inequalities and quadratic programming," Journal of Global Optimization, Springer, vol. 69(2), pages 427-442, October.
    2. Qingzhi Yang & Yang Zhou & Yuning Yang, 2019. "An Extension of Yuan’s Lemma to Fourth-Order Tensor System," Journal of Optimization Theory and Applications, Springer, vol. 180(3), pages 803-810, March.
    3. 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.

    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. 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.
    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. 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.
    4. H. Tuy & H. Tuan, 2013. "Generalized S-Lemma and strong duality in nonconvex quadratic programming," Journal of Global Optimization, Springer, vol. 56(3), pages 1045-1072, July.
    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. 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.
    7. Van-Bong Nguyen & Thi Ngan Nguyen & Ruey-Lin Sheu, 2020. "Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere," Journal of Global Optimization, Springer, vol. 76(1), pages 121-135, January.
    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. Fabián Flores-Bazán & William Echegaray & Fernando Flores-Bazán & Eladio Ocaña, 2017. "Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap," Journal of Global Optimization, Springer, vol. 69(4), pages 823-845, December.
    10. C. Durieu & É. Walter & B. Polyak, 2001. "Multi-Input Multi-Output Ellipsoidal State Bounding," Journal of Optimization Theory and Applications, Springer, vol. 111(2), pages 273-303, November.
    11. 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.
    12. 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.
    13. Zhuoyi Xu & Linbin Li & Yong Xia, 2023. "A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 98(1), pages 93-109, August.
    14. J. B. Lasserre & J. B. Hiriart-Urruty, 2002. "Mathematical Properties of Optimization Problems Defined by Positively Homogeneous Functions," Journal of Optimization Theory and Applications, Springer, vol. 112(1), pages 31-52, January.
    15. 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.
    16. A. Baccari & B. Samet, 2009. "An Extension of Polyak’s Theorem in a Hilbert Space," Journal of Optimization Theory and Applications, Springer, vol. 140(3), pages 409-418, March.
    17. 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.
    18. Florian Jarre & Felix Lieder & Ya-Feng Liu & Cheng Lu, 2020. "Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting," Journal of Global Optimization, Springer, vol. 76(4), pages 913-932, April.
    19. Derek Singh & Shuzhong Zhang, 2020. "Distributionally Robust Profit Opportunities," Papers 2006.11279, arXiv.org.
    20. 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.

    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:joptap:v:154:y:2012:i:1:d:10.1007_s10957-012-9993-9. 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.