<?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-04571492</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-25T03:48:39+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">AN ADAPTIVE FORWARD-BACKWARD-FORWARD SPLITTING ALGORITHM FOR SOLVING PSEUDO-MONOTONE INCLUSIONS</title>
            <author role="aut">
              <persName>
                <forename type="first">Flavia</forename>
                <surname>Chorobura</surname>
              </persName>
              <email type="md5">3a125a4904569753f39047937a9fe30f</email>
              <email type="domain">stud.acs.upb.ro</email>
              <idno type="idhal" notation="numeric">1381336</idno>
              <idno type="halauthorid" notation="string">3146703-1381336</idno>
              <affiliation ref="#struct-543054"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Ion</forename>
                <forename type="middle">I</forename>
                <surname>Necoara</surname>
              </persName>
              <email type="md5">440ec08f4bc667979a807f43591a3008</email>
              <email type="domain">acse.pub.ro</email>
              <idno type="idhal" notation="numeric">995170</idno>
              <idno type="halauthorid" notation="string">1088696-995170</idno>
              <affiliation ref="#struct-543054"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jean-Christophe</forename>
                <surname>Pesquet</surname>
              </persName>
              <email type="md5">e4b8355180fd3a61aeeea30cf9f936ca</email>
              <email type="domain">pesquet.eu</email>
              <idno type="idhal" notation="string">jean-christophe-pesquet</idno>
              <idno type="idhal" notation="numeric">8124</idno>
              <idno type="halauthorid" notation="string">15009-8124</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-5943-8061</idno>
              <idno type="IDREF">https://www.idref.fr/122058577</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=0E9plnpntdkC</idno>
              <affiliation ref="#struct-1043516"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Jean-Christophe</forename>
                <surname>Pesquet</surname>
              </persName>
              <email type="md5">e4b8355180fd3a61aeeea30cf9f936ca</email>
              <email type="domain">pesquet.eu</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2024-05-07 22:06:40</date>
              <date type="whenModified">2025-03-23 03:15:20</date>
              <date type="whenReleased">2024-05-21 17:28:34</date>
              <date type="whenProduced">2024-05-07</date>
              <date type="whenEndEmbargoed">2024-05-07</date>
              <ref type="file" target="https://hal.science/hal-04571492v1/document">
                <date notBefore="2024-05-07"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-04571492v1/file/Game_Theoretic_Framework-2.pdf" id="file-4571492-3963861">
                <date notBefore="2024-05-07"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="179209">
                <persName>
                  <forename>Jean-Christophe</forename>
                  <surname>Pesquet</surname>
                </persName>
                <email type="md5">e4b8355180fd3a61aeeea30cf9f936ca</email>
                <email type="domain">pesquet.eu</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-04571492</idno>
            <idno type="halUri">https://hal.science/hal-04571492</idno>
            <idno type="halBibtex">chorobura:hal-04571492</idno>
            <idno type="halRefHtml">2024</idno>
            <idno type="halRef">2024</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-4571492-3963861"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CVN">Centre pour l'Apprentissage Statistique et la Vision Numérique</idno>
            <idno type="stamp" n="CENTRALESUPELEC">Ecole CentraleSupélec</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="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="UNIVERSITE-PARIS-SACLAY" corresp="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="PSACLAY-TEST">Université Paris-Saclay - Collection pour tests</idno>
          </seriesStmt>
          <notesStmt/>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">AN ADAPTIVE FORWARD-BACKWARD-FORWARD SPLITTING ALGORITHM FOR SOLVING PSEUDO-MONOTONE INCLUSIONS</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Flavia</forename>
                    <surname>Chorobura</surname>
                  </persName>
                  <email type="md5">3a125a4904569753f39047937a9fe30f</email>
                  <email type="domain">stud.acs.upb.ro</email>
                  <idno type="idhal" notation="numeric">1381336</idno>
                  <idno type="halauthorid" notation="string">3146703-1381336</idno>
                  <affiliation ref="#struct-543054"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Ion</forename>
                    <forename type="middle">I</forename>
                    <surname>Necoara</surname>
                  </persName>
                  <email type="md5">440ec08f4bc667979a807f43591a3008</email>
                  <email type="domain">acse.pub.ro</email>
                  <idno type="idhal" notation="numeric">995170</idno>
                  <idno type="halauthorid" notation="string">1088696-995170</idno>
                  <affiliation ref="#struct-543054"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jean-Christophe</forename>
                    <surname>Pesquet</surname>
                  </persName>
                  <email type="md5">e4b8355180fd3a61aeeea30cf9f936ca</email>
                  <email type="domain">pesquet.eu</email>
                  <idno type="idhal" notation="string">jean-christophe-pesquet</idno>
                  <idno type="idhal" notation="numeric">8124</idno>
                  <idno type="halauthorid" notation="string">15009-8124</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-5943-8061</idno>
                  <idno type="IDREF">https://www.idref.fr/122058577</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=0E9plnpntdkC</idno>
                  <affiliation ref="#struct-1043516"/>
                </author>
              </analytic>
              <monogr>
                <imprint/>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Pseudo-monotone operators</term>
                <term xml:lang="en">forward-backward-forward splitting</term>
                <term xml:lang="en">adaptive stepsize</term>
                <term xml:lang="en">convergence analysis</term>
                <term xml:lang="en">nonconvex optimization</term>
              </keywords>
              <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="halDomain" n="stat.ml">Statistics [stat]/Machine Learning [stat.ML]</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 an adaptive forward-backward-forward splitting algorithm for finding a zero of a pseudo-monotone operator which is split as a sum of three operators: the first  is continuous single-valued, the second  is Lipschitzian, and the third is maximally monotone. This setting  covers, in particular,  constrained minimization scenarios, such as  problems having  smooth and convex functional constraints (e.g., quadratically constrained quadratic programs) or problems with a pseudo-convex objective function minimized over a simple closed convex  set (e.g., quadratic over linear fractional programs).  For the general problem, we design a forward-backward-forward splitting type method based on  novel adaptive stepsize strategies. Under an additional generalized Lipschitz property of the first operator,  sublinear convergence rate is derived for the sequence generated by our adaptive algorithm. Moreover, if the sum is uniformly pseudo-monotone, linear/sublinear rates are derived depending on the parameter of uniform pseudo-monotonicity. Preliminary numerical experiments  demonstrate the good performance of our method when compared to some existing optimization methods and software.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-543054" status="INCOMING">
          <orgName>University Polithenica of Bucharest</orgName>
          <desc>
            <address>
              <addrLine>Splaiul Independentei nr. 313, sector6, Bucuresti CP 060042, Romania</addrLine>
              <country key="RO"/>
            </address>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-1043516" status="VALID">
          <idno type="IdRef">183525272</idno>
          <orgName>Centre de vision numérique</orgName>
          <orgName type="acronym">CVN</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>CentraleSupélec - Bâtiment Bouygues - 3 rue Joliot Curie - 91190 GIF-SUR-YVETTE</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://cvn.centralesupelec.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation active="#struct-419361" type="direct"/>
          </listRelation>
        </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>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-419361" status="VALID">
          <idno type="IdRef">241345251</idno>
          <idno type="ROR">https://ror.org/03xjwb503</idno>
          <orgName>Université Paris-Saclay</orgName>
          <desc>
            <address>
              <addrLine>Bâtiment Bréguet, 3 Rue Joliot Curie 2e ét, 91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.universite-paris-saclay.fr/fr</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>