Publication:
Competitive least squares problem with bounded data uncertainties

Placeholder

School / College / Institute

Organizational Unit

Program

KU Authors

Co-Authors

N/A

Publication Date

Language

Embargo Status

Journal Title

Journal ISSN

Volume Title

Alternative 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

Publisher

IEEE

Subject

Engineering, Electrical and electronics engineering

Citation

Has Part

Source

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

Book Series Title

Edition

DOI

10.1109/ICASSP.2012.6288755

item.page.datauri

Link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

0

Views

0

Downloads

View PlumX Details