Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Optimization viewpoint on Kalman smoothing, with applications to robust and sparse estimation (1303.1993v2)

Published 8 Mar 2013 in math.OC, stat.CO, and stat.ML

Abstract: In this paper, we present the optimization formulation of the Kalman filtering and smoothing problems, and use this perspective to develop a variety of extensions and applications. We first formulate classic Kalman smoothing as a least squares problem, highlight special structure, and show that the classic filtering and smoothing algorithms are equivalent to a particular algorithm for solving this problem. Once this equivalence is established, we present extensions of Kalman smoothing to systems with nonlinear process and measurement models, systems with linear and nonlinear inequality constraints, systems with outliers in the measurements or sudden changes in the state, and systems where the sparsity of the state sequence must be accounted for. All extensions preserve the computational efficiency of the classic algorithms, and most of the extensions are illustrated with numerical examples, which are part of an open source Kalman smoothing Matlab/Octave package.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Aleksandr Y. Aravkin (52 papers)
  2. James V. Burke (28 papers)
  3. Gianluigi Pillonetto (46 papers)
Citations (52)

Summary

We haven't generated a summary for this paper yet.