.png){kind=icon}
.png){kind=icon}
Return
Distributed Asynchronous Time-Varying Quadratic Programming With Asynchronous Objective Sampling
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2026.3654317.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Existing works on multiagent time-varying optimization allow agents to asynchronously communicate and/or compute, but do not allow asynchronous sampling of objectives. Sampling can be difficult to synchronize, and we therefore present a multiagent optimization framework that allows asynchrony in sampling, communications, and computations for time-varying quadratic programs. We show that agents have bounded error when tracking the solution to the asynchronously sampled problem, which solves an open problem for quadratic programs. Simulations validate these results.
Keywords:
Asynchronous optimization algorithms
nonconvex optimization
time-varying optimization
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W