A Novel Robust Approach to Least Squares Problems with Bounded Data Uncertainties

Details A Novel Robust Approach to Least Squares Problems with Bounded Data Uncertainties A Novel Robust Approach to Least Squares Problems with Bounded Data Uncertainties

2012-03-19

arxiv.org/abs/1203.4160v1

Computer Science

Systems and Control

Submitted to the IEEE Transactions on Signal Processing

Scientific paper

In this correspondence, we introduce a minimax regret criteria to the least squares problems with bounded data uncertainties and solve it using semi-definite programming. We investigate a robust minimax least squares approach that minimizes a worst case difference regret. The regret is defined as the difference between a squared data error and the smallest attainable squared data error of a least squares estimator. We then propose a robust regularized least squares approach to the regularized least squares problem under data uncertainties by using a similar framework. We show that both unstructured and structured robust least squares problems and robust regularized least squares problem can be put in certain semi-definite programming forms. Through several simulations, we demonstrate the merits of the proposed algorithms with respect to the the well-known alternatives in the literature.

Affiliated with

Also associated with

No associations

Rating

A Novel Robust Approach to Least Squares Problems with Bounded Data Uncertainties does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Novel Robust Approach to Least Squares Problems with Bounded Data Uncertainties, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Novel Robust Approach to Least Squares Problems with Bounded Data Uncertainties will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-212945