IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v78y2021i3d10.1007_s10589-020-00255-2.html
   My bibliography  Save this article

Polyhedral approximations of the semidefinite cone and their application

Author

Listed:
  • Yuzhu Wang

    (University of Tsukuba)

  • Akihiro Tanaka

    (Central Research Institute of Electric Power Industry)

  • Akiko Yoshise

    (University of Tsukuba)

Abstract

We develop techniques to construct a series of sparse polyhedral approximations of the semidefinite cone. Motivated by the semidefinite (SD) bases proposed by Tanaka and Yoshise (Ann Oper Res 265:155–182, 2018), we propose a simple expansion of SD bases so as to keep the sparsity of the matrices composing it. We prove that the polyhedral approximation using our expanded SD bases contains the set of all diagonally dominant matrices and is contained in the set of all scaled diagonally dominant matrices. We also prove that the set of all scaled diagonally dominant matrices can be expressed using an infinite number of expanded SD bases. We use our approximations as the initial approximation in cutting plane methods for solving a semidefinite relaxation of the maximum stable set problem. It is found that the proposed methods with expanded SD bases are significantly more efficient than methods using other existing approximations or solving semidefinite relaxation problems directly.

Suggested Citation

  • Yuzhu Wang & Akihiro Tanaka & Akiko Yoshise, 2021. "Polyhedral approximations of the semidefinite cone and their application," Computational Optimization and Applications, Springer, vol. 78(3), pages 893-913, April.
    • Handle: RePEc:spr:coopap:v:78:y:2021:i:3:d:10.1007_s10589-020-00255-2
    DOI: 10.1007/s10589-020-00255-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-020-00255-2
    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/s10589-020-00255-2?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. Ken Kobayashi & Yuich Takano, 2020. "A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems," Computational Optimization and Applications, Springer, vol. 75(2), pages 493-513, March.
    2. Naohiko Arima & Sunyoung Kim & Masakazu Kojima & Kim-Chuan Toh, 2017. "A robust Lagrangian-DNN method for a class of quadratic optimization problems," Computational Optimization and Applications, Springer, vol. 66(3), pages 453-479, April.
    3. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(4), pages 691-705, August.
    4. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(1), pages 225-228, February.
    5. G. Dantzig & R. Fulkerson & S. Johnson, 1954. "Solution of a Large-Scale Traveling-Salesman Problem," Operations Research, INFORMS, vol. 2(4), pages 393-410, November.
    6. Hayato Waki & Masakazu Muramatsu, 2013. "Facial Reduction Algorithms for Conic Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 158(1), pages 188-215, July.
    7. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(5), pages 879-883, October.
    8. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(6), pages 1195-1198, December.
    9. Akihiro Tanaka & Akiko Yoshise, 2018. "LP-based tractable subcones of the semidefinite plus nonnegative cone," Annals of Operations Research, Springer, vol. 265(1), pages 155-182, June.
    10. Peter Dickinson & Luuk Gijben, 2014. "On the computational complexity of membership problems for the completely positive cone and its dual," Computational Optimization and Applications, Springer, vol. 57(2), pages 403-415, March.
    11. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(2), pages 411-413, April.
    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. Sunyoung Kim & Masakazu Kojima & Kim-Chuan Toh, 2020. "Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures," Journal of Global Optimization, Springer, vol. 77(3), pages 513-541, July.
    2. Yakut, Oguz, 2021. "Implementation of hydraulically driven barrel shooting control by utilizing artificial neural networks," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 190(C), pages 1206-1223.
    3. X. Qin & G. Huang, 2009. "An Inexact Chance-constrained Quadratic Programming Model for Stream Water Quality Management," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 23(4), pages 661-695, March.
    4. Md. Yousuf Gazi & Khandakar Tahmida Tafhim, 2019. "Investigation of Heavy-mineral Deposits Using Multispectral Satellite Imagery in the Eastern Coastal Margin of Bangladesh," Earth Sciences Malaysia (ESMY), Zibeline International Publishing, vol. 3(2), pages 16-22, October.
    5. Billionnet, Alain, 2011. "Solving the probabilistic reserve selection problem," Ecological Modelling, Elsevier, vol. 222(3), pages 546-554.
    6. Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
    7. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.
    8. Eichengreen, Barry & Kletzer, Kenneth & Mody, Ashoka, 2003. "Crisis Resolution: Next Steps," Santa Cruz Center for International Economics, Working Paper Series qt4cj974r4, Center for International Economics, UC Santa Cruz.
    9. Tansel, Aysit & Karao?lan, Deniz, 2016. "The Causal Effect of Education on Health Behaviors: Evidence from Turkey," IZA Discussion Papers 10020, Institute of Labor Economics (IZA).
    10. Di Feng & Bettina Klaus, 2022. "Preference revelation games and strict cores of multiple‐type housing market problems," International Journal of Economic Theory, The International Society for Economic Theory, vol. 18(1), pages 61-76, March.
    11. Anna Scherbina, 2021. "Assessing the Optimality of a COVID Lockdown in the United States," Economics of Disasters and Climate Change, Springer, vol. 5(2), pages 177-201, July.
    12. John McKay, 2005. "How Significant and Effective are North Korea's "Market Reforms"?," Global Economic Review, Taylor & Francis Journals, vol. 34(1), pages 83-97.
    13. Timothy K.M. Beatty & Erling Røed Larsen & Dag Einar Sommervoll, 2005. "Measuring the Price of Housing Consumption for Owners in the CPI," Discussion Papers 427, Statistics Norway, Research Department.
    14. Marco Bianchi & Carlos Tapia & Ikerne del Valle, 2020. "Monitoring domestic material consumption at lower territorial levels: A novel data downscaling method," Journal of Industrial Ecology, Yale University, vol. 24(5), pages 1074-1087, October.
    15. Sonmez, Tayfun & Utku Unver, M., 2005. "House allocation with existing tenants: an equivalence," Games and Economic Behavior, Elsevier, vol. 52(1), pages 153-185, July.
    16. Juarez, Ruben, 2013. "Group strategyproof cost sharing: The role of indifferences," Games and Economic Behavior, Elsevier, vol. 82(C), pages 218-239.
    17. Velloso, Helvia & Vézina, François & Bustillo, Inés, 2006. "The Canadian retirement income system," Documentos de Proyectos 3682, Naciones Unidas Comisión Económica para América Latina y el Caribe (CEPAL).
    18. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    19. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    20. Martino Bardi & Peter Caines & Italo Capuzzo Dolcetta, 2013. "Preface: DGAA Special Issue on Mean Field Games," Dynamic Games and Applications, Springer, vol. 3(4), pages 443-445, 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:coopap:v:78:y:2021:i:3:d:10.1007_s10589-020-00255-2. 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.