pith. sign in

arxiv: 2508.21414 · v1 · pith:7OQZSJATnew · submitted 2025-08-29 · 🧮 math.OC

Stochastic Online Feedback Optimization for Networks of Non-Compliant Agents

classification 🧮 math.OC
keywords optimizationonlineagentsalgorithmcontrolfeedbackframeworknetworks
0
0 comments X
read the original abstract

In several applications of online optimization to networked systems such as power grids and robotic networks, information about the system model and its disturbances is not generally available. Within the optimization community, increasing interest has been devoted to the framework of online feedback optimization (OFO), which aims to address these challenges by leveraging real-time input-output measurements to empower online optimization. We extend the OFO framework to a stochastic setting, allowing the subsystems comprising the network (the $\textit{agents}$) to be $\textit{non-compliant}$. This means that the actual control input implemented by the agents is a random variable depending upon the control setpoint generated by the OFO algorithm. Mean-square error bounds are obtained for the general algorithm and the theory is illustrated in application to power systems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Projected Stochastic Gradient Descent with Decision Dependent Distributions: Extended Version

    math.OC 2026-06 unverdicted novelty 5.0

    Develops projected primal-dual OFO algorithm for decision-dependent stochastic optimization and bounds mean-square tracking error with four interpretable terms.