<?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-03266868v1</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-16T10:29:14+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A tight compact quadratically constrained convex relaxation of the Optimal Power Flow problem</title>
            <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>
            <editor role="depositor">
              <persName>
                <forename>Amélie</forename>
                <surname>Lambert</surname>
              </persName>
              <email type="md5">850aa5cff372a203374100d4af1ac806</email>
              <email type="domain">cnam.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2023-03-06 17:00:42</date>
              <date type="whenModified">2025-07-09 15:06:18</date>
              <date type="whenReleased">2023-03-24 10:13:46</date>
              <date type="whenProduced">2023-03-06</date>
              <date type="whenEndEmbargoed">2023-03-06</date>
              <ref type="file" target="https://hal.science/hal-03266868v1/document">
                <date notBefore="2023-03-06"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-03266868v1/file/RevisionEJORels.pdf" id="file-4016756-3498470">
                <date notBefore="2023-03-06"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/2105.00453"/>
            </edition>
            <edition n="v2">
              <date type="whenSubmitted">2024-03-15 17:40:58</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="841962">
                <persName>
                  <forename>Amélie</forename>
                  <surname>Lambert</surname>
                </persName>
                <email type="md5">850aa5cff372a203374100d4af1ac806</email>
                <email type="domain">cnam.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03266868</idno>
            <idno type="halUri">https://hal.science/hal-03266868</idno>
            <idno type="halBibtex">lambert:hal-03266868</idno>
            <idno type="halRefHtml">2023</idno>
            <idno type="halRef">2023</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-4016756-3498470"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="TEST3-HALCNRS">TEST3-HALCNRS</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">preprint</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">A tight compact quadratically constrained convex relaxation of the Optimal Power Flow problem</title>
                <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>
              </analytic>
              <monogr>
                <imprint/>
              </monogr>
              <idno type="arxiv">2105.00453</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="math">Mathematics [math]</classCode>
              <classCode scheme="halDomain" n="math.math-oc">Mathematics [math]/Optimization and Control [math.OC]</classCode>
              <classCode scheme="halTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
              <classCode scheme="halOldTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
              <classCode scheme="halTreeTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In this paper, we consider the optimal power flow (OPF) problem which consists in determining the power production at each bus of an electric network by minimizing the production cost. Our contribution is an exact solution algorithm for the OPF problem. It consits in a spatial branch-and-bound algorithm based on a compact quadratically constrained convex relaxation. This compact relaxation is computed by solving the rank relaxation once at the beginning of the algorithm. The key point of this approach is that the lower bound at the root node of the branch-and-bound tree is equal to the rank relaxation value, but is obtained by solving a quadratic convex problem which is much faster than solving a SDP. To construct this compact relaxation, we add only O(n) variables that model the squares of the initial variables, where n is the number of buses in the power system. The relations between the initial and auxiliary variables are therefore non-convex. By relaxing them in our relaxation, we have only O(n) equalities to force by the branch-and-bound algorithm to prove global optimality. Our first experiments show that our new algorithm Compact OPF (COPF) performs better than the methods of the literature we compare it with</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="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>
      </listOrg>
    </back>
  </text>
</TEI>