5 papers
Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback
Gaspar Robert, Gianluca Bianchin
Optimization under zeroth-order (i.e., bandit) feedback is central to many engineering problems where the analytic forms of objectives and/or constraints are unavailable. In modern…
Convex Synthesis of First-Order Methods for Time-Varying Smooth Strongly Convex Optimization
Bryan Van Scoy, Gianluca Bianchin
Time-varying optimization is fundamental to decision-making in dynamic environments, where objectives evolve over time due to exogenous signals or data streams. However, algorithms…
Data Poisoning Attacks Can Systematically Destabilize Data-Driven Control Synthesis
Vijayanand Digge, Martina Vanelli, Ahmad W. Al-Dabbagh +2
Data-driven control has emerged as a powerful paradigm for synthesizing controllers directly from data, bypassing explicit model identification. However, this reliance on data intr…
Model-Free Aggregative Cooperative Optimization via Randomized Gradient-Free Minimization and Exploration Momentum
Amir Mehrnoosh, Giuseppe Speciale, Riccardo Brumali +2
Aggregative cooperative optimization problems arise in distributed decision-making settings where each agent's objective depends on its own decision as well as on an aggregate vari…
Two-point Random Gradient-free Methods for Model-free Feedback Optimization
Amir Mehrnoosh, Gianluca Bianchin
Feedback optimization has emerged as a promising approach for optimizing the steady-state operation of dynamical systems while requiring minimal modeling efforts. Unfortunately, mo…