<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01872996v4</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-02T21:26:10+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation</title>
            <author role="aut">
              <persName>
                <forename type="first">Sourour</forename>
                <surname>Elloumi</surname>
              </persName>
              <email type="md5">e5ba00d0790d533d384333bb0a643535</email>
              <email type="domain">ensta-paris.fr</email>
              <ptr type="url" target="https://perso.ensta-paris.fr/~elloumi/"/>
              <idno type="idhal" notation="string">sourour-elloumi</idno>
              <idno type="idhal" notation="numeric">9568</idno>
              <idno type="halauthorid" notation="string">24776-9568</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-6289-7958</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=DSjEWRQAAAAJ&amp;hl=fr</idno>
              <idno type="IDREF">https://www.idref.fr/118445103</idno>
              <affiliation ref="#struct-553460"/>
              <affiliation ref="#struct-135260"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Amélie</forename>
                <surname>Lambert</surname>
              </persName>
              <email type="md5">850aa5cff372a203374100d4af1ac806</email>
              <email type="domain">cnam.fr</email>
              <idno type="idhal" notation="string">amelie-lambert</idno>
              <idno type="idhal" notation="numeric">181603</idno>
              <idno type="halauthorid" notation="string">24788-181603</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8305-2145</idno>
              <affiliation ref="#struct-553460"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Arnaud</forename>
                <surname>Lazare</surname>
              </persName>
              <email type="md5">e1e3bd7a23280eddda0ec70eecbf1309</email>
              <email type="domain">hotmail.fr</email>
              <idno type="idhal" notation="string">arnaud-lazare</idno>
              <idno type="idhal" notation="numeric">171730</idno>
              <idno type="halauthorid" notation="string">41437-171730</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-2022-7184</idno>
              <affiliation ref="#struct-553460"/>
              <affiliation ref="#struct-135260"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Arnaud</forename>
                <surname>Lazare</surname>
              </persName>
              <email type="md5">e1e3bd7a23280eddda0ec70eecbf1309</email>
              <email type="domain">hotmail.fr</email>
            </editor>
            <funder ref="#projanr-37962"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1">
              <date type="whenSubmitted">2018-09-12 17:06:29</date>
            </edition>
            <edition n="v2">
              <date type="whenSubmitted">2019-01-18 14:32:46</date>
            </edition>
            <edition n="v3">
              <date type="whenSubmitted">2019-04-16 12:02:46</date>
            </edition>
            <edition n="v4" type="current">
              <date type="whenSubmitted">2020-03-12 14:03:49</date>
              <date type="whenWritten">2021-01-04</date>
              <date type="whenModified">2025-07-09 15:06:18</date>
              <date type="whenReleased">2020-03-13 08:47:08</date>
              <date type="whenProduced">2021-01-04</date>
              <date type="whenEndEmbargoed">2020-03-12</date>
              <ref type="file" target="https://hal.science/hal-01872996v4/document">
                <date notBefore="2020-03-12"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01872996v4/file/article_quad_conv.pdf" id="file-2506585-2382191">
                <date notBefore="2020-03-12"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1901.07904"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="643326">
                <persName>
                  <forename>Arnaud</forename>
                  <surname>Lazare</surname>
                </persName>
                <email type="md5">e1e3bd7a23280eddda0ec70eecbf1309</email>
                <email type="domain">hotmail.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01872996</idno>
            <idno type="halUri">https://hal.science/hal-01872996</idno>
            <idno type="halBibtex">elloumi:hal-01872996</idno>
            <idno type="halRefHtml">&lt;i&gt;Journal of Global Optimization&lt;/i&gt;, 2021, 80 (2), pp.231-248. &lt;a target="_blank" href="https://dx.doi.org/10.1007/s10898-020-00972-2"&gt;&amp;#x27E8;10.1007/s10898-020-00972-2&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Journal of Global Optimization, 2021, 80 (2), pp.231-248. &amp;#x27E8;10.1007/s10898-020-00972-2&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-2506585-2382191"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNAM">Conservatoire National des Arts et Métiers</idno>
            <idno type="stamp" n="UMA_ENSTA">Unité de Mathématiques Appliquées (UMA)</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="CEDRIC-CNAM" corresp="CNAM">Centre d'études et de recherche en informatique et communications </idno>
            <idno type="stamp" n="IP_PARIS">Institut Polytechnique de Paris</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="HESAM-CNAM" corresp="HESAM">Conservatoire National des Arts et Métiers - Hesam</idno>
            <idno type="stamp" n="HESAM">Hesam</idno>
            <idno type="stamp" n="ENSIIE">ENSIIE</idno>
            <idno type="stamp" n="ENSTA-PARIS">ENSTA-PARIS</idno>
            <idno type="stamp" n="ENSTA">Ensta</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Sourour</forename>
                    <surname>Elloumi</surname>
                  </persName>
                  <email type="md5">e5ba00d0790d533d384333bb0a643535</email>
                  <email type="domain">ensta-paris.fr</email>
                  <ptr type="url" target="https://perso.ensta-paris.fr/~elloumi/"/>
                  <idno type="idhal" notation="string">sourour-elloumi</idno>
                  <idno type="idhal" notation="numeric">9568</idno>
                  <idno type="halauthorid" notation="string">24776-9568</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-6289-7958</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=DSjEWRQAAAAJ&amp;hl=fr</idno>
                  <idno type="IDREF">https://www.idref.fr/118445103</idno>
                  <affiliation ref="#struct-553460"/>
                  <affiliation ref="#struct-135260"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Amélie</forename>
                    <surname>Lambert</surname>
                  </persName>
                  <email type="md5">850aa5cff372a203374100d4af1ac806</email>
                  <email type="domain">cnam.fr</email>
                  <idno type="idhal" notation="string">amelie-lambert</idno>
                  <idno type="idhal" notation="numeric">181603</idno>
                  <idno type="halauthorid" notation="string">24788-181603</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8305-2145</idno>
                  <affiliation ref="#struct-553460"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Arnaud</forename>
                    <surname>Lazare</surname>
                  </persName>
                  <email type="md5">e1e3bd7a23280eddda0ec70eecbf1309</email>
                  <email type="domain">hotmail.fr</email>
                  <idno type="idhal" notation="string">arnaud-lazare</idno>
                  <idno type="idhal" notation="numeric">171730</idno>
                  <idno type="halauthorid" notation="string">41437-171730</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-2022-7184</idno>
                  <affiliation ref="#struct-553460"/>
                  <affiliation ref="#struct-135260"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">15538</idno>
                <idno type="issn">0925-5001</idno>
                <idno type="eissn">1573-2916</idno>
                <title level="j">Journal of Global Optimization</title>
                <imprint>
                  <publisher>Springer Verlag</publisher>
                  <biblScope unit="volume">80</biblScope>
                  <biblScope unit="issue">2</biblScope>
                  <biblScope unit="pp">231-248</biblScope>
                  <date type="datePub">2021-01-04</date>
                  <date type="dateEpub">2021-01-04</date>
                </imprint>
              </monogr>
              <idno type="arxiv">1901.07904</idno>
              <idno type="doi">10.1007/s10898-020-00972-2</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Unconstrained binary polynomial programming</term>
                <term xml:lang="en">Quadratic convex reformulation</term>
                <term xml:lang="en">Experiments</term>
                <term xml:lang="en">Global optimization</term>
                <term xml:lang="en">Semidefinite programming</term>
                <term xml:lang="en">Semi-definite programming</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We propose a solution approach for the problem (P) of minimizing an unconstrained binary polynomial optimization problem. We call this method PQCR (Polynomial Quadratic Convex Reformulation). The resolution is based on a 3-phase method. The first phase consists in reformulating (P) into a quadratic program (QP). For this, we recursively reduce the degree of (P) to two, by use of the standard substitution of the product of two variables by a new one. We then obtain a linearly constrained binary program. In the second phase, we rewrite the quadratic objective function into an equivalent and parametrized quadratic function using the equality x 2 i = x i and new valid quadratic equalities. Then, we focus on finding the best parameters to get a quadratic convex program which continuous relaxation's optimal value is maximized. For this, we build a semidefinite relaxation (SDP) of (QP). Then, we prove that the standard linearization inequalities, used for the quadratization step, are redundant in (SDP) in presence of the new quadratic equalities. Next, we deduce our optimal parameters from the dual optimal solution of (SDP). The third phase consists in solving (QP *), the optimal reformulated problem, with a standard solver. In particular, at each node of the branch-and-bound, the solver computes the optimal value of a continuous quadratic convex program. We present computational results on instances of the image restoration problem and of the low autocorrelation binary sequence problem. We compare PQCR with other convexification methods, and with the general solver Baron 17.4.1 [39]. We observe that most of the considered instances can be solved with our approach combined with the use of Cplex [24].</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-553460" status="VALID">
          <orgName>CEDRIC. Optimisation Combinatoire</orgName>
          <orgName type="acronym">CEDRIC - OC</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://cedric.cnam.fr/index.php/labo/OC</ref>
          </desc>
          <listRelation>
            <relation active="#struct-16574" type="direct"/>
            <relation name="EA4629" active="#struct-179741" type="indirect"/>
            <relation name="EA4629" active="#struct-300351" type="indirect"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-135260" status="OLD">
          <orgName>Optimisation et commande</orgName>
          <orgName type="acronym">OC</orgName>
          <date type="end">2024-12-31</date>
          <desc>
            <address>
              <addrLine>828, boulevard des Maréchaux 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://uma.ip-paris.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-135257" type="direct"/>
            <relation active="#struct-300065" type="indirect"/>
            <relation active="#struct-563936" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-16574" status="VALID">
          <idno type="IdRef">155463381</idno>
          <idno type="RNSR">201119480F</idno>
          <idno type="ROR">https://ror.org/044j5mm75</idno>
          <orgName>Centre d'études et de recherche en informatique et communications</orgName>
          <orgName type="acronym">CEDRIC</orgName>
          <desc>
            <address>
              <addrLine>292 rue Saint-Martin 75141 PARIS Cedex 03Case courrier 2D4P30</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://cedric.cnam.fr/</ref>
          </desc>
          <listRelation>
            <relation name="EA4629" active="#struct-179741" type="direct"/>
            <relation name="EA4629" active="#struct-300351" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-179741" status="VALID">
          <orgName>Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise</orgName>
          <orgName type="acronym">ENSIIE</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ensiie.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300351" status="VALID">
          <idno type="IdRef">027404978</idno>
          <idno type="ISNI">0000000121690459</idno>
          <idno type="ROR">https://ror.org/0175hh227</idno>
          <orgName>Conservatoire National des Arts et Métiers [Cnam]</orgName>
          <orgName type="acronym">Cnam</orgName>
          <desc>
            <address>
              <addrLine>292 Rue Saint-Martin, 75003 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.cnam.fr/</ref>
          </desc>
        </org>
        <org type="regrouplaboratory" xml:id="struct-135257" status="OLD">
          <idno type="IdRef">203564391</idno>
          <idno type="RNSR">200022595P</idno>
          <orgName>Unité de Mathématiques Appliquées</orgName>
          <orgName type="acronym">UMA</orgName>
          <date type="end">2024-12-31</date>
          <desc>
            <address>
              <addrLine>828, boulevard des Maréchaux 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://uma.ip-paris.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300065" type="direct"/>
            <relation active="#struct-563936" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300065" status="OLD">
          <idno type="IdRef">028139577</idno>
          <idno type="ISNI">0000000122070120</idno>
          <idno type="ROR">https://ror.org/0309cs235</idno>
          <idno type="Wikidata">Q838454</idno>
          <orgName>École Nationale Supérieure de Techniques Avancées</orgName>
          <orgName type="acronym">ENSTA Paris</orgName>
          <date type="end">2024-12-31</date>
          <desc>
            <address>
              <addrLine>828, boulevard des Maréchaux 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ensta-paris.fr/fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-563936" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-563936" status="VALID">
          <idno type="IdRef">238327159</idno>
          <idno type="ISNI">0000000502717600</idno>
          <idno type="ROR">https://ror.org/042tfbd02</idno>
          <idno type="Wikidata">Q48759778</idno>
          <orgName>Institut Polytechnique de Paris</orgName>
          <orgName type="acronym">IP Paris</orgName>
          <date type="start">2019-06-02</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91120 Palaiseau Cedex, France</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ip-paris.fr</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-37962" status="VALID">
          <idno type="anr">ANR-11-LABX-0056</idno>
          <idno type="program">Centres d'excellences</idno>
          <orgName>LMH</orgName>
          <desc>LabEx Mathématique Hadamard</desc>
          <date type="start">2011</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>