arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2106.07703math.OC
收藏

基于噪声测量的全局约束分布式Optimization

Distributed Optimization with Global Constraints Using Noisy Measurements

Van Sy Mai, Richard J. La, Tao Zhang, Abdella Battou

摘要:

提出了一种新的分布式优化算法,用于求解一类约束最优化问题,其中(a)目标函数是可分的(即,代理的局部目标函数的和),(b)受非平凡局部约束的分布式代理的优化变量通过全局约束耦合,以及(c)只有噪声观测可用于估计局部目标函数(的梯度)。在许多实际情况下,代理可能不愿意与他人共享其优化变量。出于这个原因,我们提出了一个分布式算法,不需要代理共享彼此的优化变量,相反,每个代理保持一个本地估计的全局约束函数和共享的估计只与它的邻居。约束函数的这些局部估计使用共识型算法更新,而每个代理的局部最优化变量使用基于噪声梯度估计的一阶方法更新。我们证明了,当代理采用该算法,其优化变量收敛的概率为1的近似问题的最优点的基础上的惩罚方法。

英文摘要:

We propose a new distributed optimization algorithm for solving a class of constrained optimization problems in which (a) the objective function is separable (i.e., the sum of local objective functions of agents), (b) the optimization variables of distributed agents, which are subject to nontrivial local constraints, are coupled by global constraints, and (c) only noisy observations are available to estimate (the gradients of) local objective functions. In many practical scenarios, agents may not be willing to share their optimization variables with others. For this reason, we propose a distributed algorithm that does not require the agents to share their optimization variables with each other; instead, each agent maintains a local estimate of the global constraint functions and share the estimate only with its neighbors. These local estimates of constraint functions are updated using a consensus-type algorithm, while the local optimization variables of each agent are updated using a first-order method based on noisy estimates of gradient. We prove that, when the agents adopt the proposed algorithm, their optimization variables converge with probability 1 to an optimal point of an approximated problem based on the penalty method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑