IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v30y2022i3d10.1007_s10100-021-00750-9.html
   My bibliography  Save this article

Triangle-free graphs and completely positive matrices

Author

Listed:
  • Abraham Berman

    (Technion – Israel Institute of Technology)

  • Naomi Shaked-Monderer

    (The Max Stern Yezreel Valley College)

Abstract

Completely positive matrices are matrices that can be decomposed as $$BB^T$$ B B T , where B is an entrywise nonnegative matrix. These matrices have many applications, including applications to optimization. This article is a survey of some results in the theory of completely positive matrices that involve matrices whose graph contains no triangles.

Suggested Citation

  • Abraham Berman & Naomi Shaked-Monderer, 2022. "Triangle-free graphs and completely positive matrices," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(3), pages 1093-1099, September.
    • Handle: RePEc:spr:cejnor:v:30:y:2022:i:3:d:10.1007_s10100-021-00750-9
    DOI: 10.1007/s10100-021-00750-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10100-021-00750-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/s10100-021-00750-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.
    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. Wong, Man Hong & Zhang, Shuzhong, 2014. "On distributional robust probability functions and their computations," European Journal of Operational Research, Elsevier, vol. 233(1), pages 23-33.
    2. 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.
    3. Orizon Pereira Ferreira & Yingchao Gao & Sándor Zoltán Németh & Petra Renáta Rigó, 2024. "Gradient projection method on the sphere, complementarity problems and copositivity," Journal of Global Optimization, Springer, vol. 90(1), pages 1-25, September.
    4. O. I. Kostyukova & T. V. Tchemisova, 2022. "On strong duality in linear copositive programming," Journal of Global Optimization, Springer, vol. 83(3), pages 457-480, July.
    5. Immanuel Bomze & Werner Schachinger & Gabriele Uchida, 2012. "Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimization," Journal of Global Optimization, Springer, vol. 52(3), pages 423-445, March.
    6. Li, Xiaobo & Natarajan, Karthik & Teo, Chung-Piaw & Zheng, Zhichao, 2014. "Distributionally robust mixed integer linear programs: Persistency models with applications," European Journal of Operational Research, Elsevier, vol. 233(3), pages 459-473.
    7. O. I. Kostyukova & T. V. Tchemisova & O. S. Dudina, 2024. "On the Uniform Duality in Copositive Optimization," Journal of Optimization Theory and Applications, Springer, vol. 203(2), pages 1940-1966, November.
    8. 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.
    9. Jean-Baptiste Hiriart-Urruty & Hai Le, 2013. "A variational approach of the rank function," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(2), pages 207-240, July.
    10. de Klerk, Etienne & Badenbroek, Riley, 2022. "Simulated annealing with hit-and-run for convex optimization: complexity analysis and practical perspectives," Other publications TiSEM 323b4588-65e0-4889-a555-9, Tilburg University, School of Economics and Management.
    11. Zhijian Lai & Akiko Yoshise, 2022. "Completely positive factorization by a Riemannian smoothing method," Computational Optimization and Applications, Springer, vol. 83(3), pages 933-966, December.
    12. Tiago Andrade & Fabricio Oliveira & Silvio Hamacher & Andrew Eberhard, 2019. "Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming," Journal of Global Optimization, Springer, vol. 73(4), pages 701-722, April.
    13. Andreani, R. & Júdice, J.J. & Martínez, J.M. & Martini, T., 2016. "Feasibility problems with complementarity constraints," European Journal of Operational Research, Elsevier, vol. 249(1), pages 41-54.
    14. Gabriele Eichfelder & Patrick Groetzner, 2022. "A note on completely positive relaxations of quadratic problems in a multiobjective framework," Journal of Global Optimization, Springer, vol. 82(3), pages 615-626, March.
    15. Alexander Engau & Miguel Anjos & Immanuel Bomze, 2013. "Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(1), pages 35-59, August.
    16. Billionnet, Alain, 2013. "Mathematical optimization ideas for biodiversity conservation," European Journal of Operational Research, Elsevier, vol. 231(3), pages 514-534.
    17. Julia Sponsel & Stefan Bundfuss & Mirjam Dür, 2012. "An improved algorithm to test copositivity," Journal of Global Optimization, Springer, vol. 52(3), pages 537-551, March.
    18. Olga Kostyukova & Tatiana Tchemisova, 2021. "Structural Properties of Faces of the Cone of Copositive Matrices," Mathematics, MDPI, vol. 9(21), pages 1-21, October.
    19. Carmo Brás & Gabriele Eichfelder & Joaquim Júdice, 2016. "Copositivity tests based on the linear complementarity problem," Computational Optimization and Applications, Springer, vol. 63(2), pages 461-493, March.
    20. Bo Zhang & YueLin Gao & Xia Liu & XiaoLi Huang, 2023. "Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems," Journal of Global Optimization, Springer, vol. 86(1), pages 61-92, May.

    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:cejnor:v:30:y:2022:i:3:d:10.1007_s10100-021-00750-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.