Analysis of a nonsmooth optimization approach to robust estimation

In this paper, we consider the problem of identifying a linear map from measurements which are subject to intermittent and arbitrarily large errors. This is a fundamental problem in many estimation-related applications such as fault detection; state estimation in lossy networks, hybrid system identification, robust estimation, etc. The problem is hard because it exhibits some intrinsic combinatorial features. Therefore, obtaining an effective solution necessitates relaxations that are both solvable at a reasonable cost and effective in the sense that they can return the true parameter vector. The current paper discusses a nonsmooth convex optimization approach and provides a new analysis of its behavior. In particular, it is shown that under appropriate conditions on the data, an exact estimate can be recovered from data corrupted by a large (even infinite) number of gross errors. (C) 2016 Elsevier Ltd. All rights reserved.

Ohlsson, HenrikLinköpings universitet,Institutionen för systemteknik,Tekniska fakulteten,University of Calif Berkeley, CA 94720 USA(Swepub:liu)henoh44 (författare)
University of Lyon, FranceInstitutionen för systemteknik (creator_code:org_t)

Ingår i:Automatica: PERGAMON-ELSEVIER SCIENCE LTD66, s. 132-1450005-10981873-2836

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.