mlsanityData to 14 Oct 2026

Contracting Nonlinear Observers: Convex Optimization and Learning from Data

arXiv 1711.08135 ↗First posted 22 Nov 2017eess.SY cs.LG cs.SYcited by 3

Not on the map. Why?

Abstract (arXiv)

A new approach to design of nonlinear observers (state estimators) is proposed. The main idea is to (i) construct a convex set of dynamical systems which are contracting observers for a particular system, and (ii) optimize over this set for one which minimizes a bound on state-estimation error on a simulated noisy data set. We construct convex sets of continuous-time and discrete-time observers, as well as contracting sampled-data observers for continuous-time systems. Convex bounds for learning are constructed using Lagrangian relaxation. The utility of the proposed methods are verified using numerical simulation.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 22 Nov 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 0; 2025: 0; 2026: 1.

3 papers.