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

On an extension of Pólya’s Positivstellensatz

Author

Listed:
  • Peter Dickinson
  • Janez Povh

Abstract

In this paper we provide a generalization of a Positivstellensatz by Pólya [Pólya in Naturforsch Ges Zürich 73:141–145 1928 ]. We show that if a homogeneous polynomial is positive over the intersection of the non-negative orthant and a given basic semialgebraic cone (excluding the origin), then there exists a “Pólya type” certificate for non-negativity. The proof of this result uses the original Positivstellensatz by Pólya, and a Positivstellensatz by Putinar and Vasilescu [Putinar and Vasilescu C R Acad Sci Ser I Math 328(7) 1999 ]. Copyright Springer Science+Business Media New York 2015

Suggested Citation

  • Peter Dickinson & Janez Povh, 2015. "On an extension of Pólya’s Positivstellensatz," Journal of Global Optimization, Springer, vol. 61(4), pages 615-625, April.
    • Handle: RePEc:spr:jglopt:v:61:y:2015:i:4:p:615-625
    DOI: 10.1007/s10898-014-0196-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-014-0196-9
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-014-0196-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. Bomze, Immanuel M., 2012. "Copositive optimization – Recent developments and applications," European Journal of Operational Research, Elsevier, vol. 216(3), pages 509-520.
    2. de Klerk, E. & Laurent, M. & Parrilo, P., 2006. "A PTAS for the minimization of polynomials of fixed degree over the simplex," Other publications TiSEM 603897c9-179e-43e4-9e83-6, Tilburg University, School of Economics and Management.
    3. 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. Xiaolong Kuang & Bissan Ghaddar & Joe Naoum-Sawaya & Luis F. Zuluaga, 2019. "Alternative SDP and SOCP approximations for polynomial optimization," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(2), pages 153-175, June.
    2. Sergiy Butenko, 2016. "Journal of Global Optimization Best Paper Award for 2015," Journal of Global Optimization, Springer, vol. 66(4), pages 595-596, December.
    3. Peter J. C. Dickinson & Janez Povh, 2019. "A new approximation hierarchy for polynomial conic optimization," Computational Optimization and Applications, Springer, vol. 73(1), pages 37-67, 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. 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.
    2. Anwa Zhou & Jinyan Fan, 2015. "Interiors of completely positive cones," Journal of Global Optimization, Springer, vol. 63(4), pages 653-675, December.
    3. Monique Laurent & Zhao Sun, 2014. "Handelman’s hierarchy for the maximum stable set problem," Journal of Global Optimization, Springer, vol. 60(3), pages 393-423, November.
    4. de Klerk, Etienne & Laurent, Monique, 2019. "A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis," Other publications TiSEM d956492f-3e25-4dda-a5e2-e, Tilburg University, School of Economics and Management.
    5. Jinyan Fan & Anwa Zhou, 2016. "Computing the distance between the linear matrix pencil and the completely positive cone," Computational Optimization and Applications, Springer, vol. 64(3), pages 647-670, July.
    6. Amir Ali Ahmadi & Georgina Hall, 2019. "On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity," Management Science, INFORMS, vol. 44(4), pages 1192-1207, November.
    7. Peter J. C. Dickinson & Janez Povh, 2013. "Moment Approximations for Set-Semidefinite Polynomials," Journal of Optimization Theory and Applications, Springer, vol. 159(1), pages 57-68, October.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. Andrey Afonin & Roland Hildebrand & Peter J. C. Dickinson, 2021. "The extreme rays of the $$6\times 6$$ 6 × 6 copositive cone," Journal of Global Optimization, Springer, vol. 79(1), pages 153-190, January.
    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. 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.
    17. 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.
    18. 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.
    19. 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.
    20. Hao Hu & Renata Sotirov, 2021. "The linearization problem of a binary quadratic problem and its applications," Annals of Operations Research, Springer, vol. 307(1), pages 229-249, 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:61:y:2015:i:4:p:615-625. 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.