Time-varying convex optimization: Time-structured algorithms and applications
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 …
basis. Recent years have witnessed a major shift from traditional optimization paradigms …
A survey on distributed online optimization and online games
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 …
last decade, mostly motivated by their wide applications in sensor networks, robotics (eg …
Optimization and learning with information streams: Time-varying algorithms and applications
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 …
with streams of data, applied to settings where traditional batch optimization techniques …
The internet of modular robotic things: Issues, limitations, challenges, & solutions
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 …
with the increasing demands and needs for robotics, the modular robotic domain was …
Online distributed optimization with nonconvex objective functions via dynamic regrets
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 …
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 …
nonconvex optimization. We analyze its performance and obtain a dynamic regret bound …
A CMDP-within-online framework for meta-safe reinforcement learning
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 …
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 …
for time-varying composite convex optimization problems. Each node of the network features …
Online topology identification from vector autoregressive time series
Causality graphs are routinely estimated in social sciences, natural sciences, and
engineering due to their capacity to efficiently represent the spatiotemporal structure of multi …
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
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 …
theoretical (or high-level) optimization methods. This basic operation typically consists in …