arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.18511math.OC
收藏

一种带约束的局部最优实验设计自适应离散化算法

An adaptive discretization algorithm for locally optimal experimental design with constraints

Fraunhofer Institute for Industrial Mathematics (ITWM)(弗劳恩霍夫工业数学研究所)

Jochen Schmid, Philipp Seufert, Jan Schwientek, Tobias Seidel, Karl-Heinz Küfer

AI总结:

本文提出一种带约束的局部最优实验设计自适应离散化算法,通过自适应细化离散化问题,实现高效求解,在化学工程实验设计中表现出良好的收敛性。

摘要:

我们开发了一种新的迭代算法,用于在存在预算或性能约束下的局部最优实验设计。该算法是一种自适应离散化算法。在每次迭代中,求解离散化的受约束设计问题,然后通过添加合适的近似违反者来自适应地细化离散化。我们证明了当ε=0时,该算法收敛到最优设计,当ε>0时,该算法在有限次迭代后达到ε-最优设计。与现有受约束实验设计算法相比,我们的算法计算成本更低,因为非线性子问题维度更小,只需近似求解并在选定迭代中(通常最后几次)解决。此外,我们的算法覆盖了更广泛的约束类别。我们在具有时间和产量约束的化学工程实验设计问题上展示了该算法的良好收敛性。

英文摘要:

We develop a novel iterative algorithm for locally optimal experimental design under constraints, like budget or performance constraints. It is an adaptive discretization algorithm. In every iteration, a discretized version of the constrained-design problem is solved and then the discretization is adaptively refined by adding an approximate violator of a suitable sufficient $\eps$-optimality condition for the current design. We prove that with $\eps = 0$, our algorithm converges to an optimal design and that with $\eps > 0$, our algorithm finitely terminates at an $\eps$-optimal design. Compared to the existing algorithms on constrained experimental design, our algorithm comes with considerably less computational effort because the nonlinear subproblems in our algorithm have a smaller dimension and have to be solved only approximately and only in selected iterations (typically the last few). Additionally, our algorithm covers a considerably larger class of constraints. We demonstrate the good convergence properties of the algorithm on experimental design problems from chemical engineering that feature time and yield constraints.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑