A Minimax Chebyshev Estimator for Bounded Error Estimation

Authors:
Y.C. Eldar;A. Beck;M. Teboulle
Affiliations:
Technion - Israel Inst. of Technol., Haifa;-;-
Venue:
IEEE Transactions on Signal Processing
Year:
2008

Citing 0
Cited 4

Rethinking Biased Estimation: Improving Maximum Likelihood and the Cramér–Rao Bound

Foundations and Trends in Signal Processing
A new approximate algorithm for the Chebyshev center

Automatica (Journal of IFAC)
Two-level robust sequential covariance intersection fusion Kalman predictors over clustering sensor networks with uncertain noise variances

International Journal of Sensor Networks
Robust weighted fusion Kalman filters for multisensor time-varying systems with uncertain noise variances

Signal Processing

Quantified Score

Hi-index	35.69

Visualization

Abstract

We develop a nonlinear minimax estimator for the classical linear regression model assuming that the true parameter vector lies in an intersection of ellipsoids. We seek an estimate that minimizes the worst-case estimation error over the given parameter set. Since this problem is intractable, we approximate it using semidefinite relaxation, and refer to the resulting estimate as the relaxed Chebyshev center (RCC). We show that the RCC is unique and feasible, meaning it is consistent with the prior information. We then prove that the constrained least-squares (CLS) estimate for this problem can also be obtained as a relaxation of the Chebyshev center, that is looser than the RCC. Finally, we demonstrate through simulations that the RCC can significantly improve the estimation error over the CLS method.