IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v58y2014i1p31-50.html
   My bibliography  Save this article

Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations

Author

Listed:
  • V. Jeyakumar
  • G. Li
  • S. Srisatkunarajah

Abstract

In this paper we present necessary conditions for global optimality for polynomial problems with box or bivalent constraints using separable polynomial relaxations. We achieve this by first deriving a numerically checkable characterization of global optimality for separable polynomial problems with box as well as bivalent constraints. Our necessary optimality conditions can be numerically checked by solving semi-definite programming problems. Then, by employing separable polynomial under-estimators, we establish sufficient conditions for global optimality for classes of polynomial optimization problems with box or bivalent constraints. We construct underestimators using the sum of squares convex (SOS-convex) polynomials of real algebraic geometry. An important feature of SOS-convexity that is generally not shared by the standard convexity is that whether a polynomial is SOS-convex or not can be checked by solving a semidefinite programming problem. We illustrate the versatility of our optimality conditions by simple numerical examples. Copyright Springer Science+Business Media New York 2014

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jglopt:v:58:y:2014:i:1:p:31-50
    DOI: 10.1007/s10898-013-0058-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-013-0058-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-013-0058-x?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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Laurent, M., 2009. "Sums of squares, moment matrices and optimization over polynomials," Other publications TiSEM 9fef820b-69d2-43f2-a501-e, Tilburg University, School of Economics and Management.
    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. 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.
    2. 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.
    3. 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.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. Xiao Wang & Xinzhen Zhang & Guangming Zhou, 2020. "SDP relaxation algorithms for $$\mathbf {P}(\mathbf {P}_0)$$P(P0)-tensor detection," Computational Optimization and Applications, Springer, vol. 75(3), pages 739-752, April.
    10. Laurent, Monique & Vargas, Luis Felipe, 2022. "Finite convergence of sum-of-squares hierarchies for the stability number of a graph," Other publications TiSEM 3998b864-7504-4cf4-bc1d-f, Tilburg University, School of Economics and Management.
    11. Polyxeni-Margarita Kleniati & Panos Parpas & Berç Rustem, 2010. "Partitioning procedure for polynomial optimization," Journal of Global Optimization, Springer, vol. 48(4), pages 549-567, December.
    12. Laurent, M. & Rostalski, P., 2012. "The approach of moments for polynomial equations," Other publications TiSEM f08f3cd2-b83e-4bf1-9322-a, Tilburg University, School of Economics and Management.
    13. Jie Wang & Victor Magron, 2021. "Exploiting term sparsity in noncommutative polynomial optimization," Computational Optimization and Applications, Springer, vol. 80(2), pages 483-521, November.
    14. Tomohiko Mizutani & Makoto Yamashita, 2013. "Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables," Journal of Global Optimization, Springer, vol. 56(3), pages 1073-1100, July.
    15. Fook Wai Kong & Polyxeni-Margarita Kleniati & Berç Rustem, 2012. "Computation of Correlated Equilibrium with Global-Optimal Expected Social Welfare," Journal of Optimization Theory and Applications, Springer, vol. 153(1), pages 237-261, April.
    16. 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.
    17. Sandra S. Y. Tan & Antonios Varvitsiotis & Vincent Y. F. Tan, 2021. "Analysis of Optimization Algorithms via Sum-of-Squares," Journal of Optimization Theory and Applications, Springer, vol. 190(1), pages 56-81, July.
    18. Guanglei Wang & Hassan Hijazi, 2018. "Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches," Computational Optimization and Applications, Springer, vol. 71(2), pages 553-608, November.
    19. Ahmadreza Marandi & Joachim Dahl & Etienne Klerk, 2018. "A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem," Annals of Operations Research, Springer, vol. 265(1), pages 67-92, June.
    20. V. Jeyakumar & J. B. Lasserre & G. Li, 2014. "On Polynomial Optimization Over Non-compact Semi-algebraic Sets," Journal of Optimization Theory and Applications, Springer, vol. 163(3), pages 707-718, December.

    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:58:y:2014:i:1:p:31-50. 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.