arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.08537eess.SYcs.SY
收藏

非光滑凸函数在时变网络上的子梯度自由随机优化算法

Subgradient-Free Stochastic Optimization Algorithm for Non-smooth Convex Functions over Time-Varying Networks

University of Chinese Academy of Sciences(中国科学院大学);Academy of Mathematics and Systems Science, Chinese Academy of Sciences(中国科学院数学与系统科学研究院);University of Newcastle(纽卡斯尔大学)

Yinghui Wang, Wenxiao Zhao, Yiguang Hong, Mohsen Zamani

AI总结:

本文提出一种分布式随机优化算法,无需本地目标函数的梯度或子梯度信息,在时变网络中实现全局极小值的寻找,并证明了估计值的一致性和收敛性。

摘要:

本文考虑了一个分布式随机优化问题,其中本地目标函数没有梯度或子梯度信息,并受本地凸约束。目标函数可能是非光滑的,并且受到随机噪声的影响,而分布式设计的网络是时变的。通过在本地目标函数中添加随机抖动,并构造受Kiefer-Wolfowitz算法启发的随机差异,我们提出了一种分布式子梯度自由算法,以找到全局极小值。此外,我们证明在时变网络上,估计值的一致性和全局极小值可以以概率一实现,并获得了估计值的均值平均的收敛速率。最后,我们给出一个数值例子来说明所提算法的有效性。

英文摘要:

In this paper we consider a distributed stochastic optimization problem without the gradient/subgradient information for the local objective functions, subject to local convex constraints. The objective functions may be non-smooth and observed with stochastic noises, and the network for the distributed design is time-varying. By adding the stochastic dithers into the local objective functions and constructing the randomized differences motivated by the Kiefer-Wolfowitz algorithm, we propose a distributed subgradient-free algorithm to find the global minimizer with local observations. Moreover, we prove that the consensus of estimates and global minimization can be achieved with probability one over the time-varying network, and then obtain the convergence rate of the mean average of estimates as well. Finally, we give a numerical example to illustrate the effectiveness of the proposed algorithm.

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

↑