Online optimization in power systems with high penetration of renewable generation: Advances and prospects

Z Wang, W Wei, JZF Pang, F Liu, B Yang… - IEEE/CAA Journal of …, 2023 - ieeexplore.ieee.org
Traditionally, offline optimization of power systems is acceptable due to the largely
predictable loads and reliable generation. The increasing penetration of fluctuating …

Optimisation methods for dispatch and control of energy storage with renewable integration

Z Guo, W Wei, M Shahidehpour, Z Wang… - IET Smart Grid, 2022 - Wiley Online Library
Renewable energy integration is an effective measure to resolve environmental problems
and implement sustainable development, yet the volatility of wind and solar generation has …

A unifying framework for online optimization with long-term constraints

M Castiglioni, A Celli, A Marchesi… - Advances in Neural …, 2022 - proceedings.neurips.cc
We study online learning problems in which a decision maker has to take a sequence of
decisions subject to $ m $ long-term constraints. The goal of the decision maker is to …

Online convex optimization with hard constraints: Towards the best of two worlds and beyond

H Guo, X Liu, H Wei, L Ying - Advances in Neural …, 2022 - proceedings.neurips.cc
This paper considers online convex optimization with hard constraints and analyzes
achievable regret and cumulative hard constraint violation (violation for short). The problem …

Distributed online optimization for multi-agent networks with coupled inequality constraints

X Li, X Yi, L Xie - IEEE Transactions on Automatic Control, 2020 - ieeexplore.ieee.org
This article investigates the distributed online optimization problem over a multi-agent
network subject to local set constraints and coupled inequality constraints, which has a lot of …

Distributed bandit online convex optimization with time-varying coupled inequality constraints

X Yi, X Li, T Yang, L Xie, T Chai… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
Distributed bandit online convex optimization with time-varying coupled inequality
constraints is considered, motivated by a repeated game between a group of learners and …

Decentralized online convex optimization with event-triggered communications

X Cao, T Başar - IEEE Transactions on Signal Processing, 2020 - ieeexplore.ieee.org
Decentralized multi-agent optimization usually relies on information exchange between
neighboring agents, which can incur unaffordable communication overhead in practice. To …

Lyapunov optimization based mobile edge computing for Internet of Vehicles systems

Y Jia, C Zhang, Y Huang… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
Mobile-Edge Computing (MEC) is an emerging paradigm in the Internet of Vehicles (IoV) to
meet the ever-increasing computation demands of smart applications. To provide …

Distributed online convex optimization with an aggregative variable

X Li, X Yi, L Xie - IEEE Transactions on Control of Network …, 2021 - ieeexplore.ieee.org
This article investigates distributed online convex optimization in the presence of an
aggregative variable without any global/central coordinators over a multiagent network. In …

Learning to persuade on the fly: Robustness against ignorance

Y Zu, K Iyer, H Xu - Proceedings of the 22nd ACM Conference on …, 2021 - dl.acm.org
We study a repeated persuasion setting between a sender and a receiver, where at each
time t, the sender shares information about a payoff-relevant state with the receiver. The …