A column generation method with interior-point SDP solvers solves the continuous relaxation of exact D-optimal experimental design to identify support and construct near-optimal exact designs for large-scale instances.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2verdicts
UNVERDICTED 2representative citing papers
Convex reformulation and polynomial-time algorithm for spectral design problems that update a prior information matrix by rank-one updates under Euclidean-norm bounds on the design vectors.
citing papers explorer
-
A column generation approach to exact experimental design
A column generation method with interior-point SDP solvers solves the continuous relaxation of exact D-optimal experimental design to identify support and construct near-optimal exact designs for large-scale instances.
-
Optimal Spectral Design with Prior Information
Convex reformulation and polynomial-time algorithm for spectral design problems that update a prior information matrix by rank-one updates under Euclidean-norm bounds on the design vectors.