Multifidelity Topology Optimization with Runtime Verification and Acceptance Control: Benchmark Study in 2D and 3D

Topology optimization using density-based approaches often requires high-resolution meshes to achieve reliable compliance evaluation and robustness against mesh dependency. However, increasing the problem sizes-especially in 3D-results in prohibitively expensive computation times. Coarse-mesh approaches significantly accelerate runtimes; however, they also introduce discretization errors that can guide the optimizer towards incorrect topology families if left unregulated. To address this issue, a multifidelity framework with acceptance control was developed that enables runtime verification and explicitly manages the optimizer state. The main idea is to use coarse discretizations to generate new design proposals and transfer candidate designs to fine discretizations at periodic intervals for verification. Proposals are then accepted or rejected using a best-referenced criterion; if verification fails, the optimizer reverts to the best verified state. The proposed framework balances fine-discretization accountability with coarse-discretization efficiency through configurable verification schedules and a cleanup phase. The framework is evaluated on standard 2D and 3D structural benchmark problems with deterministic load perturbations, and performance is assessed in terms of final verified compliance, wall-clock runtime, acceptance rate, and gray fraction.