Publication:
Competitive least squares problem with bounded data uncertainties

Placeholder

Program

KU Authors

Co-Authors

N/A

Advisor

Publication Date

Language

English

Journal Title

Journal ISSN

Volume Title

Abstract

We study robust least squares problem with bounded data uncertainties in a competitive algorithm framework. We propose a competitive least squares (LS) approach that minimizes the worst case “regret” which is the difference between the squared data error and the smallest attainable squared data error of an LS estimator. We illustrate that the robust least squares problem can be put in an SDP form for both structured and unstructured data matrices and uncertainties. Through numerical examples we demonstrate the potential merit of the proposed approaches.

Source:

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Publisher:

IEEE

Keywords:

Subject

Engineering, Electrical and electronics engineering

Citation

Endorsement

Review

Supplemented By

Referenced By

Copyrights Note

0

Views

0

Downloads

View PlumX Details