We present ellipsoid algorithms for convexly constrained estimation an
d design problems. The proposed polynomial time algorithms yield both
an estimate of the complete set of feasible solutions and a point esti
mate in the interior. Optimal cutting hyperplanes are derived, and a c
omputationally efficient sequential cut algorithm is proposed and show
n to achieve the best existing polynomial time performance bound.