Publication:
Competitive least squares problem with bounded data uncertainties

Simple item page
dc.contributor.coauthorN/A
dc.contributor.departmentDepartment of Electrical and Electronics Engineering
dc.contributor.departmentN/A
dc.contributor.departmentN/A
dc.contributor.kuauthorKozat, Süleyman Serdar
dc.contributor.kuauthorDönmez, Mehmet Ali
dc.contributor.kuauthorKalantarova, Nargiz
dc.contributor.kuprofileFaculty Member
dc.contributor.kuprofileMaster Student
dc.contributor.kuprofilePhD Student
dc.contributor.otherDepartment of Electrical and Electronics Engineering
dc.contributor.schoolcollegeinstituteCollege of Engineering
dc.contributor.schoolcollegeinstituteGraduate School of Sciences and Engineering
dc.contributor.schoolcollegeinstituteGraduate School of Sciences and Engineering
dc.contributor.yokid177972
dc.contributor.yokidN/A
dc.contributor.yokidN/A
dc.date.accessioned2024-11-09T23:22:43Z
dc.date.issued2012
dc.description.abstractWe 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.
dc.description.indexedbyWoS
dc.description.indexedbyScopus
dc.description.openaccessYES
dc.description.publisherscopeInternational
dc.description.sponsorshipInst. Electr. Electron. Eng. Signal Process. Soc.
dc.identifier.doi10.1109/ICASSP.2012.6288755
dc.identifier.isbn9781-4673-0046-9
dc.identifier.issn1520-6149
dc.identifier.linkhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84867619178anddoi=10.1109%2fICASSP.2012.6288755andpartnerID=40andmd5=493d6cd7abddd39de65e4fe840333e0b
dc.identifier.quartileN/A
dc.identifier.scopus2-s2.0-84867619178
dc.identifier.urihttp://dx.doi.org/10.1109/ICASSP.2012.6288755
dc.identifier.urihttps://hdl.handle.net/20.500.14288/11119
dc.identifier.wos312381403227
dc.keywordsDeterministic
dc.keywordsMin-max
dc.keywordsRegret
dc.keywordsRobust least squares
dc.keywordsBounded data uncertainties
dc.keywordsCompetitive algorithms
dc.keywordsData errors
dc.keywordsDeterministic
dc.keywordsLeast squares
dc.keywordsLeast squares problems
dc.keywordsLS estimator
dc.keywordsMin-max
dc.keywordsNumerical example
dc.keywordsRegret
dc.keywordsRobust least squares
dc.keywordsUnstructured data
dc.keywordsElectrical engineering
dc.keywordsSignal processing
dc.languageEnglish
dc.publisherIEEE
dc.sourceICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
dc.subjectEngineering
dc.subjectElectrical and electronics engineering
dc.titleCompetitive least squares problem with bounded data uncertainties
dc.typeConference proceeding
dspace.entity.typePublication
local.contributor.authorid0000-0002-6488-3848
local.contributor.authoridN/A
local.contributor.authoridN/A
local.contributor.kuauthorKozat, Süleyman Serdar
local.contributor.kuauthorDönmez, Mehmet Ali
local.contributor.kuauthorKalantarova, Nargiz
relation.isOrgUnitOfPublication21598063-a7c5-420d-91ba-0cc9b2db0ea0
relation.isOrgUnitOfPublication.latestForDiscovery21598063-a7c5-420d-91ba-0cc9b2db0ea0

Files

Collections

Publications without Fulltext