Pith. sign in

REVIEW

Efficient Computational Algorithm for Optimal Continuous Experimental Designs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1804.02655 v1 pith:OI6Y6A2Y submitted 2018-04-08 stat.CO

classification stat.CO
keywords algorithmcontinuousdesignoptimalproposedcomputationalconvergenceefficient
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

A simple yet efficient computational algorithm for computing the continuous optimal experimental design for linear models is proposed. An alternative proof the monotonic convergence for $D$-optimal criterion on continuous design spaces are provided. We further show that the proposed algorithm converges to the $D$-optimal design. We also provide an algorithm for the $A$-optimality and conjecture that the algorithm convergence monotonically on continuous design spaces. Different numerical examples are used to demonstrated the usefulness and performance of the proposed algorithms.

Discussion (0). Sign in to comment.

Pith tools