English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Coordinate exchange (CEXCH) is a popular algorithm for generating exactoptimal experimental designs. The authors of CEXCH advocated for a highlygreedy implementation - one that exchanges and optimizes single elementcoordinates of the design matrix. We revisit the effect of greediness on CEXCHsefficacy for generating highly efficient designs. We implement thesingle-element CEXCH (most greedy), a design-row (medium greedy) optimizationexchange, and particle swarm optimization (PSO; least greedy) on 21 exactresponse surface design scenarios, under the $D$- and $I-$criterion, which havewell-known optimal designs that have been reproduced by several researchers. Wefound essentially no difference in performance of the most greedy CEXCH and themedium greedy CEXCH. PSO did exhibit better efficacy for generating $D$-optimaldesigns, and for most $I$-optimal designs than CEXCH, but not to a strongdegree under our parametrization. This work suggests that further investigationof the greediness dimension and its effect on CEXCH efficacy on a wider suiteof models and criterion is warranted.

Revisiting the effect of greediness on the efficacy of exchange algorithms for generating exact optimal experimental designs