<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Black-Box Min-Max Optimization using CMA-ES</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>YYoouhheeiiAAkkimimoototo</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Tsukuba</institution>
          ,
          <country country="JP">Japan</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Simulation-based optimization, where the objective function value f(x) is computed through a numerical simulation given design variable x, appears widely in engineering problems. However, it is often observed that a solution obtained by simulationbased optimization do not perform as well on the real environment as on the simulation, due to the difference between the real environment and the simulation. This is one of the factors that impair the reliability of the optimization result in the simulation. The problem of finding a solution robust to such error and uncertainty is often formulated as a minimax optimization, where we try to locate the best solution under the worst possible situation, to guarantee the worst case performance. In this talk, we present CMA-ES, which is recognized as one of the most powerful solvers for simulation-based optimization and has been applied to many real-world applications. Then, we present our recent developments in black-box minimax optimization using CMA-ES.</p>
      </abstract>
    </article-meta>
  </front>
  <body />
  <back>
    <ref-list />
  </back>
</article>