Metraipolis › archive › dc_9f910608a4bb

On Solving Continuous-Discrete Projection Filters via Sum-of-Squares Relaxation — arXiv:2608.28002

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.28002
License (as archived)
CC0-1.0
Archived
2026-10-17T11:17:50.388Z
SHA-256 of the archived text
c4cd4b7005797f04e84f984b6756af07f43e296eb7c18a7ba5292574c98d6a6e
Stable URL of this page
https://metraipolis.com/documento/dc_9f910608a4bb

How to cite

On Solving Continuous-Discrete Projection Filters via Sum-of-Squares Relaxation — arXiv:2608.28002 — arXiv (en), https://arxiv.org/abs/2608.28002 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9f910608a4bb (Metraipolis archive dc_9f910608a4bb, sha256 c4cd4b7005797f04e84f984b6756af07f43e296eb7c18a7ba5292574c98d6a6e)
BibTeX
@misc{dc9f910608a4bb,
  title = {On Solving Continuous-Discrete Projection Filters via Sum-of-Squares Relaxation — arXiv:2608.28002},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.28002},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9f910608a4bb; sha256 c4cd4b7005797f04e84f984b6756af07f43e296eb7c18a7ba5292574c98d6a6e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.28002. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The continuous-discrete projection filter offers a rigorous framework to approximate the solution of the nonlinear state estimation problems. However, it suffers from numerical instability during the prediction phase when integration errors force the natural parameters outside their admissible domain. To address this issue, we introduce the sum-of-squares (SOS) relaxation to constrain the evolution of the natural parameters within the admissible domain. By parameterizing the underlying SOS matrix using the log-Cholesky map, we derive a projected ordinary differential equation (ODE) that inherently preserves the necessary positivity constraints without requiring the computationally expensive online optimization checks associated with previous semi-infinite programming approach. We provide a theoretical derivation of this positivity-preserving propagation scheme and present the explicit SOS-relaxed evolution equations for the Gaussian case.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-31 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2608.28002 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T10:58:16.478Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).