IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v82y2015i3p243-264.html
   My bibliography  Save this article

Global optimality conditions for cubic minimization problems with cubic constraints

Author

Listed:
  • Xue-Gang Zhou
  • Xiao-Peng Yang
  • Bing-Yuan Cao

Abstract

In this paper, we present global optimality conditions for cubic minimization involving cubic constraints and box or bivalent constraints, where the cubic objective function and cubic constraints contain no cross terms. By utilizing quadratic underestimators, we first derive sufficient global optimality conditions for a global minimizer of cubic minimization problems with cubic inequality and box constraints. Then we establish them for cubic minimization with cubic inequality and bivalent constraints. Finally, we establish sufficient and necessary global optimality condition for cubic minimization with cubic equality and binary constraints. Copyright Springer-Verlag Berlin Heidelberg 2015

Suggested Citation

  • Xue-Gang Zhou & Xiao-Peng Yang & Bing-Yuan Cao, 2015. "Global optimality conditions for cubic minimization problems with cubic constraints," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(3), pages 243-264, December.
    • Handle: RePEc:spr:mathme:v:82:y:2015:i:3:p:243-264
    DOI: 10.1007/s00186-015-0511-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-015-0511-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00186-015-0511-3?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. Z. Y. Wu & V. Jeyakumar & A. M. Rubinov, 2007. "Sufficient Conditions for Global Optimality of Bivalent Nonconvex Quadratic Programs with Inequality Constraints," Journal of Optimization Theory and Applications, Springer, vol. 133(1), pages 123-130, April.
    2. V. Jeyakumar & G. Li & S. Srisatkunarajah, 2014. "Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations," Journal of Global Optimization, Springer, vol. 58(1), pages 31-50, January.
    3. Vaithilingam Jeyakumar & Zhiyou Wu, 2007. "Conditions For Global Optimality Of Quadratic Minimization Problems With Lmi Constraints," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 24(02), pages 149-160.
    4. M. Ç. Pinar, 2004. "Sufficient Global Optimality Conditions for Bivalent Quadratic Optimization," Journal of Optimization Theory and Applications, Springer, vol. 122(2), pages 433-440, August.
    5. Z. Y. Wu & A. M. Rubinov, 2010. "Global Optimality Conditions for Some Classes of Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 145(1), pages 164-185, April.
    6. Guoyin Li, 2012. "Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition," Journal of Optimization Theory and Applications, Springer, vol. 152(3), pages 710-726, March.
    7. Wei Chen & Liansheng Zhang, 2010. "Global optimality conditions for quadratic 0-1 optimization problems," Journal of Global Optimization, Springer, vol. 46(2), pages 191-206, February.
    8. Yanjun Wang & Zhian Liang, 2010. "Global optimality conditions for cubic minimization problem with box or binary constraints," Journal of Global Optimization, Springer, vol. 47(4), pages 583-595, August.
    9. V. Jeyakumar & S. Srisatkunarajah, 2009. "New Sufficiency for Global Optimality and Duality of Mathematical Programming Problems via Underestimators," Journal of Optimization Theory and Applications, Springer, vol. 140(2), pages 239-247, February.
    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. V. Jeyakumar & G. Li & S. Srisatkunarajah, 2014. "Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations," Journal of Global Optimization, Springer, vol. 58(1), pages 31-50, January.
    2. Wu, Zhiyou & Tian, Jing & Quan, Jing & Ugon, Julien, 2014. "Optimality conditions and optimization methods for quartic polynomial optimization," Applied Mathematics and Computation, Elsevier, vol. 232(C), pages 968-982.
    3. Thai Doan Chuong, 2020. "Semidefinite Program Duals for Separable Polynomial Programs Involving Box Constraints," Journal of Optimization Theory and Applications, Springer, vol. 185(1), pages 289-299, April.
    4. Gary Kochenberger & Jin-Kao Hao & Fred Glover & Mark Lewis & Zhipeng Lü & Haibo Wang & Yang Wang, 2014. "The unconstrained binary quadratic programming problem: a survey," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 58-81, July.
    5. Z. Y. Wu & A. M. Rubinov, 2010. "Global Optimality Conditions for Some Classes of Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 145(1), pages 164-185, April.
    6. Guoyin Li, 2012. "Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition," Journal of Optimization Theory and Applications, Springer, vol. 152(3), pages 710-726, March.
    7. X. Zheng & X. Sun & D. Li & Y. Xu, 2012. "On zero duality gap in nonconvex quadratic programming problems," Journal of Global Optimization, Springer, vol. 52(2), pages 229-242, February.
    8. Amar Andjouh & Mohand Ouamer Bibi, 2022. "Adaptive Global Algorithm for Solving Box-Constrained Non-convex Quadratic Minimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 192(1), pages 360-378, January.
    9. Wu, Zhiyou & Tian, Jing & Ugon, Julien & Zhang, Liang, 2015. "Global optimality conditions and optimization methods for constrained polynomial programming problems," Applied Mathematics and Computation, Elsevier, vol. 262(C), pages 312-325.
    10. Z. Wu & J. Tian & J. Ugon, 2015. "Global optimality conditions and optimization methods for polynomial programming problems," Journal of Global Optimization, Springer, vol. 62(4), pages 617-641, August.
    11. Z. Y. Wu & J. Quan & G. Q. Li & J. Tian, 2012. "Necessary Optimality Conditions and New Optimization Methods for Cubic Polynomial Optimization Problems with Mixed Variables," Journal of Optimization Theory and Applications, Springer, vol. 153(2), pages 408-435, May.
    12. Harish Palanthandalam-Madapusi & Tobin Van Pelt & Dennis Bernstein, 2009. "Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint," Computational Optimization and Applications, Springer, vol. 45(4), pages 533-549, December.
    13. Z. Wu & G. Li & J. Quan, 2011. "Global optimality conditions and optimization methods for quadratic integer programming problems," Journal of Global Optimization, Springer, vol. 51(3), pages 549-568, November.
    14. Z. Y. Wu & Y. J. Yang & F. S. Bai & M. Mammadov, 2011. "Global Optimality Conditions and Optimization Methods for Quadratic Knapsack Problems," Journal of Optimization Theory and Applications, Springer, vol. 151(2), pages 241-259, November.
    15. Wei Chen & Liansheng Zhang, 2010. "Global optimality conditions for quadratic 0-1 optimization problems," Journal of Global Optimization, Springer, vol. 46(2), pages 191-206, February.
    16. Yanjun Wang & Zhian Liang, 2010. "Global optimality conditions for cubic minimization problem with box or binary constraints," Journal of Global Optimization, Springer, vol. 47(4), pages 583-595, August.
    17. Leonardo Lozano & David Bergman & J. Cole Smith, 2020. "On the Consistent Path Problem," Operations Research, INFORMS, vol. 68(6), pages 1913-1931, November.
    18. Shenglong Hu & Guoyin Li & Liqun Qi & Yisheng Song, 2013. "Finding the Maximum Eigenvalue of Essentially Nonnegative Symmetric Tensors via Sum of Squares Programming," Journal of Optimization Theory and Applications, Springer, vol. 158(3), pages 717-738, September.
    19. V. Jeyakumar & Guoyin Li, 2011. "Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems," Journal of Global Optimization, Springer, vol. 49(1), pages 1-14, January.
    20. Hossein Mohebi & Alexander Rubinov, 2006. "Metric Projection onto a Closed Set: Necessary and Sufficient Conditions for the Global Minimum," Mathematics of Operations Research, INFORMS, vol. 31(1), pages 124-132, 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:mathme:v:82:y:2015:i:3:p:243-264. 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.