We study a class of uncertain linear estimation problems in which the data are affected by random uncertainty. In this setting, we consider two estimation criteria, one based on minimization of the expected l1 or l2 norm residual and one based on minimization of the level within which the l1 or l2 norm residual is guaranteed to lie with an a-priori fixed probability (residual at risk). The random uncertainty affecting the data is characterized by means of its first two statistical moments, and the above criteria are intended in a worst-case probabilistic sense, that is worst-case expectations and probabilities over all possible distribution having the specified moments are considered. The ensuing estimation problems can be solved efficiently via convex programming, yielding exact solutions in the l2 norm case and upper-bounds on the optimal solutions in the l1 case.
Parameter Estimation with Expected and Residual-at-Risk Criteria / Calafiore, Giuseppe Carlo; U., Topcu; L., EL GHAOUI. - STAMPA. - (2008), pp. 666-671. (Intervento presentato al convegno 47th IEEE Conference on Decision and Control tenutosi a Cancun, Mexico nel 9-11 Dec. 2008) [10.1109/CDC.2008.4738597].
Parameter Estimation with Expected and Residual-at-Risk Criteria
CALAFIORE, Giuseppe Carlo;
2008
Abstract
We study a class of uncertain linear estimation problems in which the data are affected by random uncertainty. In this setting, we consider two estimation criteria, one based on minimization of the expected l1 or l2 norm residual and one based on minimization of the level within which the l1 or l2 norm residual is guaranteed to lie with an a-priori fixed probability (residual at risk). The random uncertainty affecting the data is characterized by means of its first two statistical moments, and the above criteria are intended in a worst-case probabilistic sense, that is worst-case expectations and probabilities over all possible distribution having the specified moments are considered. The ensuing estimation problems can be solved efficiently via convex programming, yielding exact solutions in the l2 norm case and upper-bounds on the optimal solutions in the l1 case.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1894272
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo