Pith. sign in

REVIEW 2 cited by

Online Feedback Optimization and Singular Perturbation via Contraction Theory

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.07966 v3 pith:VOCRRD5V submitted 2023-10-12 eess.SY cs.SY

classification eess.SYcs.SY
keywords systemsboundsfeedbacksolutionsboundedcontractioncontractivitycontroller
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper, we provide a novel contraction-theoretic approach to analyze two-time scale systems, including those commonly encountered in Online Feedback Optimization (OFO). Our framework endows these systems with several robustness properties, enabling a more comprehensive characterization of their behaviors. The primary assumptions are the contractivity of the fast sub-system and the reduced model, along with an explicit upper bound on the time-scale parameter. For two-time scale systems subject to disturbances, we show that the distance between solutions of the nominal system and solutions of its reduced model is uniformly upper bounded by a function of contraction rates, Lipschitz constants, the time-scale parameter, and the variability of the disturbances over time. Applying these general results to the OFO context, we establish new individual tracking error bounds, showing that solutions converge to their time-varying optimizer, provided the plant and steady-state feedback controller exhibit contractivity and the controller gain is suitably bounded. Finally, we explore two special cases: for autonomous nonlinear systems, we derive sharper bounds than those in the general results, and for linear time-invariant systems, we present novel bounds based on induced matrix norms and induced matrix log norms.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Similarity Matching Networks: Hebbian Learning and Convergence Over Multiple Time Scales

    q-bio.NC 2025-06 conditional novelty 6.0 of 10

    A continuous-time Hebbian/anti-Hebbian similarity matching network is shown to converge layer by layer to the principal subspace solution, with the slow layer convergence relying on two unproven conjectures.

  2. Sampled-data Systems: Stability, Contractivity and Single-iteration Suboptimal MPC

    eess.SY 2025-05 conditional novelty 6.0 of 10

    A sampled-data control loop is exponentially stable for small sampling periods, and even a single optimization iteration per sample suffices when the idealized continuous-feedback model is contractive.

Pith tools