Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)
  • search hit 3 of 155
Back to Result List

Solving the optimal experiment design problem with mixed-integer convex methods

  • We tackle the Optimal Experiment Design Problem, which consists of choosing experiments to run or observations to select from a finite set to estimate the parameters of a system. The objective is to maximize some measure of information gained about the system from the observations, leading to a convex integer optimization problem. We leverage Boscia.jl, a recent algorithmic framework, which is based on a nonlinear branch-and-bound algorithm with node relaxations solved to approximate optimality using Frank-Wolfe algorithms. One particular advantage of the method is its efficient utilization of the polytope formed by the original constraints which is preserved by the method, unlike alternative methods relying on epigraph-based formulations. We assess our method against both generic and specialized convex mixed-integer approaches. Computational results highlight the performance of our proposed method, especially on large and challenging instances.

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Metadaten
Author:Deborah Hendrych, Mathieu Besançon, Sebastian Pokutta
Document Type:In Proceedings
Parent Title (English):22nd International Symposium on Experimental Algorithms (SEA 2024)
Volume:301
First Page:16:1
Last Page:16:22
Series:Leibniz International Proceedings in Informatics (LIPIcs)
Year of first publication:2024
DOI:https://doi.org/10.4230/LIPIcs.SEA.2024.16
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.