Set estimation via ellipsoidal approximations

Ashutosh Sabharwal, Lee Potter

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


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

Original languageEnglish (US)
Pages (from-to)3107-3112
Number of pages6
JournalIEEE Transactions on Signal Processing
Issue number12
StatePublished - Dec 1997

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering


Dive into the research topics of 'Set estimation via ellipsoidal approximations'. Together they form a unique fingerprint.

Cite this