Time-varying convex optimization: Time-structured algorithms and applications

A Simonetto, E Dall'Anese, S Paternain… - Proceedings of the …, 2020 - ieeexplore.ieee.org
Optimization underpins many of the challenges that science and technology face on a daily
basis. Recent years have witnessed a major shift from traditional optimization paradigms …

A survey on distributed online optimization and online games

X Li, L Xie, N Li - Annual Reviews in Control, 2023 - Elsevier
Distributed online optimization and online games have been increasingly researched in the
last decade, mostly motivated by their wide applications in sensor networks, robotics (eg …

Optimization and learning with information streams: Time-varying algorithms and applications

E Dall'Anese, A Simonetto, S Becker… - IEEE Signal …, 2020 - ieeexplore.ieee.org
There is a growing cross-disciplinary effort in the broad domain of optimization and learning
with streams of data, applied to settings where traditional batch optimization techniques …

The internet of modular robotic things: Issues, limitations, challenges, & solutions

JPA Yaacoub, HN Noura, B Piranda - Internet of Things, 2023 - Elsevier
The world is becoming more digitized with the rise of modular robotic systems. Therefore,
with the increasing demands and needs for robotics, the modular robotic domain was …

Online distributed optimization with nonconvex objective functions via dynamic regrets

K Lu, L Wang - IEEE Transactions on Automatic Control, 2023 - ieeexplore.ieee.org
In this article, the problem of online distributed optimization subject to a convex set is studied
by employing a network of agents, where the objective functions allocated to agents are …

Second-order online nonconvex optimization

A Lesage-Landry, JA Taylor… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
We present the online Newton's method, a single-step second-order method for online
nonconvex optimization. We analyze its performance and obtain a dynamic regret bound …

A CMDP-within-online framework for meta-safe reinforcement learning

V Khattar, Y Ding, B Sel, J Lavaei, M Jin - arXiv preprint arXiv:2405.16601, 2024 - arxiv.org
Meta-reinforcement learning has widely been used as a learning-to-learn framework to
solve unseen tasks with limited experience. However, the aspect of constraint violations has …

Distributed and inexact proximal gradient method for online convex optimization

N Bastianello, E Dall'Anese - 2021 European Control …, 2021 - ieeexplore.ieee.org
This paper develops and analyzes an online distributed proximal-gradient method (DPGM)
for time-varying composite convex optimization problems. Each node of the network features …

Online topology identification from vector autoregressive time series

B Zaman, LML Ramos, D Romero… - IEEE Transactions …, 2020 - ieeexplore.ieee.org
Causality graphs are routinely estimated in social sciences, natural sciences, and
engineering due to their capacity to efficiently represent the spatiotemporal structure of multi …

Principled analyses and design of first-order methods with inexact proximal operators

M Barré, AB Taylor, F Bach - Mathematical Programming, 2023 - Springer
Proximal operations are among the most common primitives appearing in both practical and
theoretical (or high-level) optimization methods. This basic operation typically consists in …