PRIME: Fast Primal-Dual Feedback Optimization for Markets with Application to Optimal Power Flow
summary
The gist
Online Feedback Optimization (OFO) controllers iteratively drive a plant to an optimal operating point that satisfies input and output constraints…
In short
PRIME is a novel feedback optimization approach using proximal-point iterations to drive a system to an optimal operating point while incorporating market incentives. It allows self-interested actors to make choices that satisfy constraints and minimize costs without needing private information, achieving fast convergence and robustness against measurement noise.
Key concepts
- Online Feedback Optimization (OFO)
- A method where a system iteratively adjusts its inputs based on the difference between desired outputs and actual measured outputs. It aims to find an optimal operating point that respects all input and output limits by using only this input-output sensitivity as model information.
- PRIME (Proximal Iterative MarkEts)
- A new OFO method based on proximal-point iterations. It is designed for market applications where actors are incentivized to operate safely and efficiently. It handles complex objective functions well, converges quickly, and rejects measurement noise effectively.
- Market Model Formulation
- This framework involves multiple input actors and output actors aiming to minimize a combined cost function subject to various constraints. The market operator designs incentives so that individual self-interested decisions lead the entire system toward a cooperative optimum.
- PRIME-Y and PRIME-H Implementations
- These are two specific versions of PRIME. PRIME-Y focuses on input actors, while PRIME-H introduces an auxiliary variable to dualize constraints, allowing for the distribution of incentives across both input and output actors while maintaining privacy.
Terminology used across episodes
This episode discusses
- PRIME: Fast Primal-Dual Feedback Optimization for Markets with Application to Optimal Power Flow · Paper Radio
The paper
PRIME: Fast Primal-Dual Feedback Optimization for Markets with Application to Optimal Power Flow · Read on arXiv
Nicholas Julian Behr, Mattia Bianchi, Keith Moffat, Saverio Bolognani, Florian Dorfler
ETH Zurich
Online Feedback Optimization (OFO) controllers iteratively drive a plant to an optimal operating point that satisfies input and output constraints, relying solely on the input-output sensitivity as model information. This paper introduces PRIME (PRoximal Iterative MarkEts), a novel OFO approach based on proximal-point iterations. Unlike existing OFO solutions, PRIME admits a market-based implementation, where self-interested actors are incentivized to make choices that result in safe and efficient operation, without communicating private costs or constraints. Furthermore, PRIME can handle non-smooth objective functions, achieve fast convergence rates and rapid constraint satisfaction, and effectively reject measurement noise. We demonstrate PRIME on an AC optimal power flow problem, obtaining an efficient real-time nonlinear local marginal pricing scheme.
DOI: 10.1109/CDC57313.2025.11312508
Transcript
Introduction to the show: ident: Robotics Radio. Generated commentary on the latest robotics and control papers.
Rosa: I'm Rosa.
Dev: And I'm Dev, here with Taro.
Rosa: We're looking at the paper: "PRIME: Fast Primal-Dual Feedback Optimization for Markets with Application to Optimal Power Flow".
Dev: Here's the gist of the paper. Online Feedback Optimization (OFO) controllers iteratively drive a plant to an optimal operating point that satisfies input and output constraints, relying solely on the input-output sensitivity as model information PRIME (PRoximal Iterative MarkEts), a novel OFO approach based on proximal-point iterations, admits a market-based implementation where self-interested actors are incentivized to make choices that result in safe and efficient operation without communicating private costs or constraints Furthermore, PRIME can handle non-smooth objective functions, achieve fast convergence rates and rapid constraint satisfaction, and effectively reject measurement noise.
Rosa: Market Model Formulation The work focuses on a market involving nu input actors and ny output actors where the goal is to minimize a combined objective function subject to input and output constraints The market operator aims to superpose incentives such that when actors minimize their local cost subject to their private constraints, the plant is steered toward a cooperative optimum.
Dev: Specifically, the mechanism involves incentives distributed by the market operator influencing actor decisions, and self-interested actors reacting by minimizing their overall cost given their private cost plus payment.
Rosa: PRIME-Y Implementation PRIME-Y OFO employs proximal minimization instead of gradient descent to update the variable u, defined as u k+1 = argmin u Y(u, λk+1y) + γu squared u - u k squared.
Paper summary: Rosa: So, this paper introduces PRIME: Fast Primal-Dual Feedback Optimization for Markets with Application to Optimal Power Flow. Basically, it takes online feedback optimization or OFO controllers and builds a new approach based on proximal-point iterations. The big idea here is to make it work in a market setting where actors are self-interested but still end up steering the plant toward a safe and efficient operating point without needing to talk about their private costs or constraints directly.
Dev: That's right, Rosa. The core claim of PRIME is that it handles non-smooth objective functions, achieves fast convergence rates, and can quickly satisfy constraints while also rejecting measurement noise that messes with other methods. It shows an efficient real-time nonlinear local marginal pricing scheme on an AC optimal power flow problem.
Taro: So it’s about making things robust when the plant model isn't perfect and when you have these actors making decisions based only on what they can see and what they know privately, right?
Rosa: Exactly. The paper sets up a market with input actors minimizing their private costs subject to their constraints, and output actors doing the same for their costs and constraints as well. The goal is to superimpose incentives so that when everyone minimizes their local cost based on what they have, the whole plant moves toward a cooperative optimum.
Dev: And PRIME does this by using proximal minimization instead of standard gradient descent to update the variables. Specifically, for PRIME-Y implementation, it updates the variable u with a quadratic term involving the square of the difference between steps and its previous value <ref:2504.16048#pg3>.
Taro: So if we're looking at how this update works in practice, it seems they are approximating a Lagrangian using its linearization at each timestep k to handle that unknown input-output map h(u) <ref:2504.16048#pg2>.
Rosa: Right. And for the PRIME-H implementation, they dualize the output constraint by introducing an auxiliary variable called z, and then they use a proximal iteration to update both u and z based on an approximation of that Lagrangian H(u, z).
Paper summary: Dev: That structure is interesting because it allows them to seek a saddle point of this Lagrangian using the proximal iteration <ref:2504.16048#pg5>. It defines the output actor's incentive in a specific way involving that auxiliary variable z and the measurement record y k <ref:2504.16048#pg2>.
Taro: When we look at the performance, simulations on an Optimal Power Flow problem show that PRIME matches the performance of standard centralized methods regarding constraint resolution and convergence speed, while still benefiting from that market-based distributability <ref:2504.16048#pg6>.
Rosa: And a really important part is its robustness. PRIME-Y and PRIME-H both deliver fast constraint violation resolution and they reject the effect of measurement noise, unlike Algorithm one which the paper points out is sensitive to noise <ref:2504.16048#pg7>.
Dev: The decentralization capabilities are also key here. The paper shows that PRIME-H allows for both input and output actors to be distributed over both sets of actors, except for the specific case involving linear output costs and constraints Table I.
Taro: That means the market operator doesn't need any private information about what the input or output actors are charging or what their limits are to figure out the incentives. It preserves privacy for everyone involved in that distribution Table I.
Rosa: So, to sum up this PRIME: Fast Primal-Dual Feedback Optimization for Markets with Application to Optimal Power Flow approach, it's a novel way of designing optimal incentives in markets with self-interested actors without them needing access to their private costs or constraints.
Dev: It’s an optimization technique that uses proximal iterations to solve the problem iteratively, which gives it those fast convergence rates and helps it handle the non-smooth nature of these problems better than older methods.
Taro: What this means for us in the real world is that we can design control systems for complex power grids or any network where many agents are making local decisions, and they can still cooperate to meet global goals efficiently, even when the model isn't perfect.
Rosa: Right. It moves the problem from a centralized calculation to a distributed one where local actions lead to a good overall outcome without needing that central authority to see everything <ref:2504.16048#pg2>.
Paper summary: Dev: We also have the caveat that the paper points out that if you use standard projected primal gradient methods, like Algorithm one and your plant model h is nonlinear or if there's measurement noise around it, the feasible set for those variables can become empty which breaks recursive feasibility <ref:2504.16048#pg3>.
Taro: So the paper highlights that PRIME is designed specifically to avoid that failure mode by using proximal minimization and dualizing the constraints instead of just relying on a projection onto a set <ref:2504.16048#pg2>.
Rosa: It’s interesting how they compare it to standard Projected Primal Gradient OFO, which uses feedback from the plant to replace the function h of u with the actual measured y k <ref:2504.16048#pg3>.
Dev: And that comparison shows that PRIME-Y and PRIME-H deliver fast constraint violation resolution while rejecting measurement noise, which is a big win for real-time control systems <ref:2504.16048#pg7>.
Taro: So when you look at the results on the UNICORN fifty-six-bus test case, the performance of PRIME aligns with standard centralized methods in terms of how fast they resolve constraints and how quickly they converge <ref:2504.16048#pg6>.
Rosa: It sounds like the real implication here is that for systems where you have many interconnected components making decisions, this market-based approach gives us a way to get good operating points without needing perfect information about every single constraint or cost function beforehand <ref:2504.16048#pg1>.
Dev: And the final part of the PRIME: Fast Primal-Dual Feedback Optimization for Markets with Application to Optimal Power Flow paper is that it gives us a way to structure incentives so that actors can make choices that are both safe and efficient, even when they are only optimizing their own local cost functions <ref:2504.16048#pg1>.
Taro: It’s about creating a system where the self-interest of the actors naturally aligns with the global needs of the power flow, and PRIME gives us a fast way to find that alignment <ref:2504.16048#pg3>.
Rosa: That's what they are showing, using proximal point iterations to drive these actors toward an optimal operating point in a dynamic environment without needing all those private details exposed <ref:2504.16048#pg1>.
Conclusion: Rosa: So we're wrapping up on PRIME, which is this new way to handle optimization in markets using proximal iterations for power flow problems.
Dev: Yeah, so basically, they took online feedback optimization and tweaked it to work with these market actors who are self-interested but still cooperate to get the best plant settings without them having all your private cost details.
Rosa: Right, so the big idea is designing these incentives in a way that doesn't require the market operator to know everything about what each actor is charging or what their limits are.
Dev: Exactly, and they do it by using this dualizing technique with an auxiliary variable, and then applying a proximal iteration to find a saddle point of that complex Lagrangian function.
Rosa: And I mean, the results on the optimal power flow problem show that this method matches the performance of standard centralized methods in terms of how fast they resolve constraints and how quickly they converge.
Dev: That’s good, but what really stands out is how PRIME-Y and PRIME-H handle measurement noise much better than older methods like Algorithm one.
Rosa: So, even when the world misbehaves with some noisy measurements, this approach keeps resolving those constraint violations fast.
Dev: And from a real-world control standpoint, that robustness is key because we can't always assume perfect data in a system running in real time.
Rosa: It means for someone trying to design control systems for complex grids or power networks, they have a way to get good operating points without needing perfect information about every single constraint or cost function beforehand.
Dev: It moves the problem from a centralized calculation to something distributed where local actions lead to a good overall outcome without that central authority having all the private details exposed.
Rosa: So it’s less about one perfect answer and more about creating a system where self-interest naturally aligns with the global needs of the power flow, and PRIME gives us a fast way to find that alignment.
Dev: That's what they show with this proximal iteration approach, but we still have to look at what happens when those market actors start making strategic choices against each other.
More episodes
- 2608.13438-ContactGuard: Pre-Contact Execution Monitoring with Action-Conditioned Latent World Models
- 2610.34593-Future Prediction as Training-Only Video Supervision for Pretrained VLA Policies
- 2610.35385-EmbodiedLab: Beyond Manipulation, Benchmarking Embodied Agents That Act to Know
- 2610.36378-Data-Driven Hamiltonian for Neural Optimal Control
- 2610.37275-A Heuristic for Scheduling Autonomous Vehicles at Intersections
- 2610.37288-Dynamic Coordination of Autonomous Vehicles at Intersections
- 2610.37632-Real-Time Coordination of Autonomous Vehicles at Intersections
- 2611.13779-Softness is something you also need! Why compliance helps control: information metrics of a passive walker with compliant ankle
- 2611.13411-Residual-Corrected Physics-Informed Neural Network KKL Observers with Input-to-State Stability Guarantees
- 2611.14488-Is Your Robot's Memory Just a Clock? Temporal Shortcuts in Memory-Augmented VLA Policies