{
  "abstract": "Bilevel optimization involves an upper-level and a lower-level decision maker. The lower-level optimization problem is nested within the constraints of the upper-level one. A point is said to be admissible for the bilevel problem if it satisfies all constraints and is optimal for the lower-level decision-maker. Bilevel derivative-free optimization (BL-DFO) algorithms address bilevel optimization problems in which the upper-level is solved using a derivative-free optimization method, and an inexact method it used to solve the lower- level. In this context, existing BL-DFO benchmarking techniques often do not rigorously validate the admissibility of proposed solutions, and do not adequately account for the computational effort deployed by the upper- and lower-level solvers. This work proposes a benchmarking methodology for BL-DFO algorithms. A post-optimization procedure, named the refereeing procedure, is introduced to discard non-admissible points and ensures a fair comparison between the algorithms. The computational effort deployed by upper- and lower-level solvers is also taken into account into the overall computational cost. Numerical experiments illustrate the benchmarking methodology.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2605.30531",
  "author_total": 3,
  "authors": [
    {
      "name": "Charles Audet"
    },
    {
      "name": "Valentin Dijon"
    },
    {
      "name": "Youssef Diouane"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/3vmq70qvr69xc.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2605.30531",
  "fulltext_url": null,
  "id": "3vmq70qvr69xc",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2605.30531",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.OC"
    ],
    [
      "openalex",
      "2612|Advanced Optimization Algorithms Research"
    ]
  ],
  "openalex": "W7163016651",
  "pdf_url": "https://arxiv.org/pdf/2605.30531",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-20",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/3vmq70qvr69xc.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:34:22Z",
      "native_id": "2605.30531",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2605.30531"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.OC",
      "subfield": "optimisation-control"
    }
  ],
  "title": "Benchmarking Bilevel Derivative-Free Optimization Algorithms",
  "title_text": "Benchmarking Bilevel Derivative-Free Optimization Algorithms",
  "type": "preprint",
  "updated_at": "2026-10-30T12:34:22Z",
  "url": "https://research.draconitic.com/paper/3vmq70qvr69xc",
  "venue": "arXiv",
  "versions": []
}