Growing window recursive quadratic optimization with variable regularization

Asad A. Ali, Jesse B. Hoagg, Magnus Mossberg, Dennis S. Bernstein

Producción científica: Conference contributionrevisión exhaustiva

5 Citas (Scopus)

Resumen

We present a growing-window variable-regularization recursive least squares (GW-VR-RLS) algorithm. Standard recursive least squares (RLS) uses a time-invariant regularization. More specifically, the inverse of the initial covariance matrix in classical RLS can be viewed as a regularization term, which weights the difference between the next state estimate and the initial state estimate. The present paper allows for time-varying in the weighting as well as what is being weighted. This extension can be used to modulate the speed of convergence of the estimates versus the magnitude of transient estimation errors. Furthermore, the regularization term can weight the difference between the next state estimate and a time-varying vector of parameters rather than the initial state estimate as is required in standard RLS.

Idioma originalEnglish
Título de la publicación alojada2010 49th IEEE Conference on Decision and Control, CDC 2010
Páginas496-501
Número de páginas6
DOI
EstadoPublished - 2010
Evento49th IEEE Conference on Decision and Control, CDC 2010 - Atlanta, United States
Duración: dic 15 2010dic 17 2010

Serie de la publicación

NombreProceedings of the IEEE Conference on Decision and Control
ISSN (versión impresa)0743-1546
ISSN (versión digital)2576-2370

Conference

Conference49th IEEE Conference on Decision and Control, CDC 2010
País/TerritorioUnited States
CiudadAtlanta
Período12/15/1012/17/10

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Huella

Profundice en los temas de investigación de 'Growing window recursive quadratic optimization with variable regularization'. En conjunto forman una huella única.

Citar esto