<?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-04474444v2</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-23T11:12:50+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A fractal-based decomposition framework for continuous optimization</title>
            <author role="crp">
              <persName>
                <forename type="first">Thomas</forename>
                <surname>Firmin</surname>
              </persName>
              <email type="md5">141048bd33ee1bfbc5b5c21ed8d1fd25</email>
              <email type="domain">univ-lille.fr</email>
              <idno type="idhal" notation="string">thomas-firmin</idno>
              <idno type="idhal" notation="numeric">1165653</idno>
              <idno type="halauthorid" notation="string">2586491-1165653</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-5157-8393</idno>
              <affiliation ref="#struct-410272"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">El-Ghazali</forename>
                <surname>Talbi</surname>
              </persName>
              <email type="md5">2dc127747aac5b2147f152ac70dea2e5</email>
              <email type="domain">univ-lille.fr</email>
              <idno type="idhal" notation="string">talbi-el-ghazali</idno>
              <idno type="idhal" notation="numeric">11350</idno>
              <idno type="halauthorid" notation="string">24310-11350</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-4549-1010</idno>
              <idno type="IDREF">https://www.idref.fr/070160082</idno>
              <affiliation ref="#struct-505216"/>
              <affiliation ref="#struct-374570"/>
              <affiliation ref="#struct-410272"/>
              <affiliation ref="#struct-104752"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Thomas</forename>
                <surname>Firmin</surname>
              </persName>
              <email type="md5">141048bd33ee1bfbc5b5c21ed8d1fd25</email>
              <email type="domain">univ-lille.fr</email>
            </editor>
            <funder ref="#projanr-51237"/>
            <funder ref="#projanr-98377"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1">
              <date type="whenSubmitted">2024-02-23 10:17:07</date>
            </edition>
            <edition n="v2" type="current">
              <date type="whenSubmitted">2024-11-13 19:37:25</date>
              <date type="whenWritten">2022-07-01</date>
              <date type="whenModified">2026-05-05 15:53:06</date>
              <date type="whenReleased">2024-11-20 13:13:06</date>
              <date type="whenProduced">2022-07-01</date>
              <date type="whenEndEmbargoed">2024-11-13</date>
              <ref type="file" target="https://hal.science/hal-04474444v2/document">
                <date notBefore="2024-11-13"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-04474444v2/file/sn-article.pdf" id="file-4781633-4163766">
                <date notBefore="2024-11-13"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="1153846">
                <persName>
                  <forename>Thomas</forename>
                  <surname>Firmin</surname>
                </persName>
                <email type="md5">141048bd33ee1bfbc5b5c21ed8d1fd25</email>
                <email type="domain">univ-lille.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-04474444</idno>
            <idno type="halUri">https://hal.science/hal-04474444</idno>
            <idno type="halBibtex">firmin:hal-04474444</idno>
            <idno type="halRefHtml">2022</idno>
            <idno type="halRef">2022</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-4781633-4163766"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA-LILLE">INRIA Lille - Nord Europe</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="GRID5000">Grid'5000</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="CRISTAL">Centre de Recherche en Informatique, Signal et Automatique de Lille (CRISTAL)</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="CRISTAL-BONUS" corresp="CRISTAL">Bibliographie de l’équipe BONUS</idno>
            <idno type="stamp" n="UNIV-LILLE">Université de Lille</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="NUMPEX">PEPR NumPEx</idno>
            <idno type="stamp" n="ANR-IA-20" corresp="ANR-IA">ANR-IA-20</idno>
            <idno type="stamp" n="ANR-IA">ANR-IA</idno>
            <idno type="stamp" n="SLICES-FR">Publications from users of the SILECS research infrastructure</idno>
          </seriesStmt>
          <notesStmt/>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">A fractal-based decomposition framework for continuous optimization</title>
                <author role="crp">
                  <persName>
                    <forename type="first">Thomas</forename>
                    <surname>Firmin</surname>
                  </persName>
                  <email type="md5">141048bd33ee1bfbc5b5c21ed8d1fd25</email>
                  <email type="domain">univ-lille.fr</email>
                  <idno type="idhal" notation="string">thomas-firmin</idno>
                  <idno type="idhal" notation="numeric">1165653</idno>
                  <idno type="halauthorid" notation="string">2586491-1165653</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-5157-8393</idno>
                  <affiliation ref="#struct-410272"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">El-Ghazali</forename>
                    <surname>Talbi</surname>
                  </persName>
                  <email type="md5">2dc127747aac5b2147f152ac70dea2e5</email>
                  <email type="domain">univ-lille.fr</email>
                  <idno type="idhal" notation="string">talbi-el-ghazali</idno>
                  <idno type="idhal" notation="numeric">11350</idno>
                  <idno type="halauthorid" notation="string">24310-11350</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-4549-1010</idno>
                  <idno type="IDREF">https://www.idref.fr/070160082</idno>
                  <affiliation ref="#struct-505216"/>
                  <affiliation ref="#struct-374570"/>
                  <affiliation ref="#struct-410272"/>
                  <affiliation ref="#struct-104752"/>
                </author>
              </analytic>
              <monogr>
                <imprint/>
              </monogr>
              <relatedItem target="https://doi.org/10.57745/0JEUEK" type="Cites" subtype="http://purl.org/coar/resource_type/c_ddb1"/>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Continuous optimization</term>
                <term xml:lang="en">Metaheuristic</term>
                <term xml:lang="en">High-dimensional optimization</term>
                <term xml:lang="en">Decomposition</term>
                <term xml:lang="en">Fractal</term>
                <term xml:lang="en">Tree search</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</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 propose a generic algorithmic framework which defines a unified view of fractal decomposition algorithms for continuous optimization. Fractals allow building a hierarchical decomposition of the decision space by using a self-similar geometrical object. The proposed generic framework is made of five distinct and independent search components: fractal geometrical object, tree search, scoring, exploration and exploitation. The genericity of the framework allowed the instantiation of popular algorithms from the optimization, machine learning and computational intelligence communities. Moreover, new optimization algorithms can be designed using various strategies of the search components. This shows the modularity of the proposed algorithmic framework. The computational experiments emphasize the behaviors of fractal-based approaches in terms of scalability, robustness, and the balance between exploitation and exploration in the search space. The obtained results show the significance of each search component of the fractal framework, and the necessity to build harder and well-defined benchmarks which can assess the performance of deterministic, axis-aligned and symmetrical decomposition-based algorithms.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-410272" status="VALID">
          <idno type="IdRef">18388695X</idno>
          <idno type="RNSR">201521249L</idno>
          <idno type="ROR">https://ror.org/05vrs3189</idno>
          <idno type="Wikidata">Q116959497</idno>
          <orgName>Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189</orgName>
          <orgName type="acronym">CRIStAL</orgName>
          <date type="start">2015-01-01</date>
          <desc>
            <address>
              <addrLine>Université de Lille - Campus scientifique - Bâtiment ESPRIT - Avenue Henri Poincaré - 59655 Villeneuve d’Ascq</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cristal.univ-lille.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UMR9189" active="#struct-120930" type="direct"/>
            <relation name="UMR9189" active="#struct-374570" type="direct"/>
            <relation name="UMR9189" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-505216" status="VALID">
          <idno type="RNSR">201722535A</idno>
          <idno type="ROR">https://ror.org/04zja0e38</idno>
          <orgName>Optimisation de grande taille et calcul large échelle</orgName>
          <orgName type="acronym">BONUS</orgName>
          <date type="start">2017-07-01</date>
          <date type="end">2027-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.inria.fr/equipes/bonus</ref>
          </desc>
          <listRelation>
            <relation active="#struct-104752" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-410272" type="direct"/>
            <relation name="UMR9189" active="#struct-120930" type="indirect"/>
            <relation name="UMR9189" active="#struct-374570" type="indirect"/>
            <relation name="UMR9189" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-374570" status="VALID">
          <idno type="IdRef">223446556</idno>
          <idno type="ISNI">0000 0001 2242 6780</idno>
          <idno type="ROR">https://ror.org/02kzqn938</idno>
          <idno type="Wikidata">Q3551621</idno>
          <orgName>Université de Lille</orgName>
          <desc>
            <address>
              <addrLine>EPE Université de Lille. -- 42 rue Paul Duez, 59000 Lille</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.univ-lille.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-104752" status="VALID">
          <idno type="RNSR">200818245B</idno>
          <idno type="ROR">https://ror.org/04eej9726</idno>
          <orgName>Centre Inria de l'Université de Lille</orgName>
          <desc>
            <address>
              <addrLine>Parc Scientifique de la Haute Borne 40, avenue Halley Bât.A, Park Plaza 59650 Villeneuve d'Ascq</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/lille/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-120930" status="VALID">
          <idno type="IdRef">256304629</idno>
          <idno type="ISNI">0000000122034461</idno>
          <idno type="ROR">https://ror.org/01x441g73</idno>
          <orgName>Centrale Lille</orgName>
          <desc>
            <address>
              <addrLine>École Centrale de Lille - Cité Scientifique - CS 20048 59651 Villeneuve d'Ascq Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://centralelille.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-51237" status="VALID">
          <idno type="anr">ANR-20-THIA-0014</idno>
          <orgName>AI_PhD@Lille</orgName>
          <desc>Programme de formation doctorale en IA à Lille</desc>
          <date type="start">2020</date>
        </org>
        <org type="anrProject" xml:id="projanr-98377" status="VALID">
          <idno type="anr">ANR-22-EXNU-0002</idno>
          <orgName>Exa-MA</orgName>
          <desc>Methods and Algorithms for Exascale</desc>
          <date type="start">2022</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>