Multiple-Response Agents: Fast, Feasible, Approximate Primal Recovery for Dual Optimization <ethods

• Manuscript

We consider the problem of minimizing the sum of agent functions subject to affine coupling constraints. Dual methods are attractive for such problems because they allow the agent-level subproblems to be solved in parallel. However, achieving primal feasibility with dual methods is a challenge; it can take many iterations to find sufficiently precise prices that recover a primal feasible solution, and even with exact prices primal feasibility is not guaranteed, unless special conditions like strict convexity hold. This behavior can limit the usefulness of dual decomposition methods. To overcome this limitation, we propose a novel primal recovery method, multiple-response agents (MRA), that is able to rapidly reduce primal infeasibility, tolerating some degree of suboptimality, and can be used with any dual algorithm. Rather than returning a single primal response to each price query, MRA requires agents to generate multiple primal responses, each of which has bounded suboptimality. These multiple responses can be computed in parallel, so there is no increase in the wall clock time of the underlying dual algorithm. Then a convex combination of the multiple responses is formed by minimizing the sum of the primal and complementary slackness residuals. We test MRA using both a price localization method and a dual subgradient method and show that it typically converges to a feasible, approximate solution in a few tens of iterations. Moreover, hyperparameters can be tuned to control the trade-off among speed, computational budget, and degree of suboptimality of the feasible solutions returned.