IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v81y2022i1d10.1007_s10589-021-00325-z.html
   My bibliography  Save this article

A sublevel moment-SOS hierarchy for polynomial optimization

Author

Listed:
  • Tong Chen

    (LAAS-CNRS)

  • Jean-Bernard Lasserre

    (LAAS-CNRS
    Université Toulouse 3 Paul Sabatier)

  • Victor Magron

    (LAAS-CNRS
    Université Toulouse 3 Paul Sabatier)

  • Edouard Pauwels

    (Université Toulouse 3 Paul Sabatier
    Université de Toulouse)

Abstract

We introduce a sublevel Moment-SOS hierarchy where each SDP relaxation can be viewed as an intermediate (or interpolation) between the d-th and $$(d+1)$$ ( d + 1 ) -th order SDP relaxations of the Moment-SOS hierarchy (dense or sparse version). With the flexible choice of determining the size (level) and number (depth) of subsets in the SDP relaxation, one is able to obtain different improvements compared to the d-th order relaxation, based on the machine memory capacity. In particular, we provide numerical experiments for $$d=1$$ d = 1 and various types of problems both in combinatorial optimization (Max-Cut, Mixed Integer Programming) and deep learning (robustness certification, Lipschitz constant of neural networks), where the standard Lasserre’s relaxation (or its sparse variant) is computationally intractable. In our numerical results, the lower bounds from the sublevel relaxations improve the bound from Shor’s relaxation (first order Lasserre’s relaxation) and are significantly closer to the optimal value or to the best-known lower/upper bounds.

Suggested Citation

  • Tong Chen & Jean-Bernard Lasserre & Victor Magron & Edouard Pauwels, 2022. "A sublevel moment-SOS hierarchy for polynomial optimization," Computational Optimization and Applications, Springer, vol. 81(1), pages 31-66, January.
    • Handle: RePEc:spr:coopap:v:81:y:2022:i:1:d:10.1007_s10589-021-00325-z
    DOI: 10.1007/s10589-021-00325-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-021-00325-z
    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-021-00325-z?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. Monique Laurent, 2003. "A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0--1 Programming," Mathematics of Operations Research, INFORMS, vol. 28(3), pages 470-496, August.
    2. Jean B. Lasserre & Kim-Chuan Toh & Shouguang Yang, 2017. "A bounded degree SOS hierarchy for polynomial optimization," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 87-117, March.
    3. Jie Wang & Victor Magron, 2021. "Exploiting term sparsity in noncommutative polynomial optimization," Computational Optimization and Applications, Springer, vol. 80(2), pages 483-521, November.
    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. 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.
    2. Adam Kurpisz & Samuli Leppänen & Monaldo Mastrolilli, 2018. "Sum-of-squares rank upper bounds for matching problems," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 831-844, October.
    3. 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.
    4. Campos, Juan S. & Misener, Ruth & Parpas, Panos, 2019. "A multilevel analysis of the Lasserre hierarchy," European Journal of Operational Research, Elsevier, vol. 277(1), pages 32-41.
    5. Immanuel M. Bomze & Vaithilingam Jeyakumar & Guoyin Li, 2018. "Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations," Journal of Global Optimization, Springer, vol. 71(3), pages 551-569, July.
    6. Eric Gautier & Christiern Rose, 2022. "Fast, Robust Inference for Linear Instrumental Variables Models using Self-Normalized Moments," Papers 2211.02249, arXiv.org, revised Nov 2022.
    7. T. D. Chuong & V. Jeyakumar & G. Li, 2019. "A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs," Journal of Global Optimization, Springer, vol. 75(4), pages 885-919, December.
    8. Pratik Worah, 2015. "Rank bounds for a hierarchy of Lovász and Schrijver," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 689-709, October.
    9. Thomas Rothvoß & Laura Sanità, 2017. "0/1 Polytopes with Quadratic Chvátal Rank," Operations Research, INFORMS, vol. 65(1), pages 212-220, February.
    10. Marandi, Ahmadreza, 2017. "Aspects of quadratic optimization - nonconvexity, uncertainty, and applications," Other publications TiSEM d2b9c576-7128-4ee4-939a-7, Tilburg University, School of Economics and Management.
    11. Adam Kurpisz & Samuli Leppänen & Monaldo Mastrolilli, 2017. "On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 135-143, January.
    12. Gábor Braun & Samuel Fiorini & Sebastian Pokutta & David Steurer, 2015. "Approximation Limits of Linear Programs (Beyond Hierarchies)," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 756-772, March.
    13. Meng-Meng Zheng & Zheng-Hai Huang & Sheng-Long Hu, 2022. "Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space," Journal of Global Optimization, Springer, vol. 84(2), pages 415-440, October.
    14. Thomas Rothvoß & Laura Sanità, 2017. "0/1 Polytopes with Quadratic Chvátal Rank," Operations Research, INFORMS, vol. 65(1), pages 212-220, February.
    15. de Klerk, E. & Pasechnik, D.V., 2009. "On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems," Other publications TiSEM 3b5033a4-98bc-4969-aa57-d, Tilburg University, School of Economics and Management.
    16. 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.
    17. Jie Wang & Victor Magron, 2022. "Exploiting Sparsity in Complex Polynomial Optimization," Journal of Optimization Theory and Applications, Springer, vol. 192(1), pages 335-359, January.
    18. Moslem Zamani, 2019. "A new algorithm for concave quadratic programming," Journal of Global Optimization, Springer, vol. 75(3), pages 655-681, November.
    19. de Klerk, E. & Pasechnik, D.V., 2005. "A Note on the Stability Number of an Orthogonality Graph," Other publications TiSEM 8fc31de5-93ae-4966-836a-f, Tilburg University, School of Economics and Management.
    20. Trang T. Nguyen & Jean-Philippe P. Richard & Mohit Tawarmalani, 2021. "Convexification techniques for linear complementarity constraints," Journal of Global Optimization, Springer, vol. 80(2), pages 249-286, June.

    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:81:y:2022:i:1:d:10.1007_s10589-021-00325-z. 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.