<?xml version="1.0" encoding="UTF-8"?>

<?xml-stylesheet type="text/xsl" href="/static/oaitohtml.xsl"?>

<!--
<?xml-stylesheet type="text/xsl" href="/oaitohtml.xsl"?>
-->

<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
    <responseDate>2026-10-13T03:06:33Z</responseDate>
    <request verb="GetRecord" metadataPrefix="oai_dc" identifier="10.57760/sciencedb.011oz" >https://www.scidb.cn/oai</request>
<GetRecord>
    <record>
    <header >
    <identifier>10.57760/sciencedb.011oz</identifier>
    <datestamp>2026-09-13T20:12:53Z</datestamp>
</header>
    <metadata>
        
<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:date>2026-09-13</dc:date>
  <dc:title>Numerical simulation dataset for a virtual-queue-based online convex optimization algorithm using Lyapunov optimization</dc:title>
  <dc:identifier>doi:10.57760/sciencedb.011oz</dc:identifier>
  <dc:language>en</dc:language>
  <dc:description>This dataset contains the numerical experiment results reported in the paper &amp;ldquo;Research on Online Convex Optimization Algorithms With Long-term Constraints Based on Lyapunov Optimization.&amp;rdquo; It includes the performance data of the proposed virtual-queue-based online convex optimization algorithm using Lyapunov optimization and the comparison algorithms proposed by Yi et al. (2021) and Yuan and Lamperski (2018) under three experimental settings: online linear&amp;nbsp;programming with a known total number of rounds, online linear programming with an unknown total number of rounds, and&amp;nbsp;a setting with strongly convex loss functions. The main performance metrics are cumulative loss and cumulative constraint violation. The reported results are averaged over 500 independent repetitions for each setting. The dataset&amp;nbsp;can be used to reproduce the numerical results reported in the paper and to compare the performance of the algorithms.</dc:description>
  <dc:subject>online convex optimization; long-term constraints; regret; cumulative constraint violation; Lyapunov opti mization</dc:subject>
  <dc:creator>shen lu ge</dc:creator>
  <dc:rights>PUBLIC</dc:rights>
  <dc:rights>https://creativecommons.org/publicdomain/zero/1.0/</dc:rights>
  <dc:type>dataset</dc:type>
  <dc:publisher>Science Data Bank</dc:publisher>
</oai_dc:dc>

    </metadata>
</record>
</GetRecord>
</OAI-PMH>