Set estimation via ellipsoidal approximations

Ellipsoid algorithms for convexly constrained estimation and design problems were proposed. The proposed polynomial time algorithms can produce an estimate of the complete set of solutions and point estimates in the interior. Furthermore, the computationally accurate sequential algorithm can provide an estimation performance that is equal to the known polynomial time performance bound.