IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/fabb1d61-6395-4123-9174-befd2f18932b.html
   My bibliography  Save this paper

On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings

Author

Listed:
  • Burgdorf, S.
  • Laurent, Monique

    (Tilburg University, School of Economics and Management)

  • Piovesan, Teresa

    (Tilburg University, School of Economics and Management)

Abstract

No abstract is available for this item.

Suggested Citation

  • Burgdorf, S. & Laurent, Monique & Piovesan, Teresa, 2017. "On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings," Other publications TiSEM fabb1d61-6395-4123-9174-b, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiutis:fabb1d61-6395-4123-9174-befd2f18932b
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/19950624/Completely_positive_semidefinite_cone.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    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. Gribling, Sander & Laat, David de & Laurent, Monique, 2017. "Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization," Other publications TiSEM 2dddf156-3d4b-4936-bf02-a, Tilburg University, School of Economics and Management.

    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. Qingsong Tang & Xiangde Zhang & Guoren Wang & Cheng Zhao, 2018. "A continuous characterization of the maximum vertex-weighted clique in hypergraphs," Journal of Combinatorial Optimization, Springer, vol. 35(4), pages 1250-1260, May.
    2. M. Locatelli, 2009. "Complexity Results for Some Global Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 140(1), pages 93-102, January.
    3. 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.
    4. Etienne de Klerk & Jean B. Lasserre & Monique Laurent & Zhao Sun, 2017. "Bound-Constrained Polynomial Optimization Using Only Elementary Calculations," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 834-853, August.
    5. 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.
    6. Muhammad Faisal Iqbal & Faizan Ahmed, 2022. "Approximation Hierarchies for the Copositive Tensor Cone and Their Application to the Polynomial Optimization over the Simplex," Mathematics, MDPI, vol. 10(10), pages 1-17, May.
    7. de Klerk, E. & den Hertog, D. & Elabwabi, G., 2008. "On the complexity of optimization over the standard simplex," European Journal of Operational Research, Elsevier, vol. 191(3), pages 773-785, December.
    8. 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.
    9. 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.
    10. 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.
    11. Guy Kindler & Assaf Naor & Gideon Schechtman, 2010. "The UGC Hardness Threshold of the L p Grothendieck Problem," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 267-283, May.
    12. 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.
    13. Immanuel Bomze & Stefan Gollowitzer & E. Yıldırım, 2014. "Rounding on the standard simplex: regular grids for global optimization," Journal of Global Optimization, Springer, vol. 59(2), pages 243-258, July.
    14. Marco Locatelli, 2013. "Approximation algorithm for a class of global optimization problems," Journal of Global Optimization, Springer, vol. 55(1), pages 13-25, January.
    15. Jesús A. De Loera & Raymond Hemmecke & Matthias Köppe & Robert Weismantel, 2006. "Integer Polynomial Optimization in Fixed Dimension," Mathematics of Operations Research, INFORMS, vol. 31(1), pages 147-153, February.

    More about this item

    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:tiu:tiutis:fabb1d61-6395-4123-9174-befd2f18932b. 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: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    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.