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

具有时变费用函数的分布式无约束Optimization

Distributed Unconstrained Optimization with Time-varying Cost Functions

University of California Irvine(加州大学欧文分校)

Amir-Salar Esteki, Solmaz S. Kia

摘要:

本文提出了一种新的解决方案的分布式无约束最优化问题的总成本是随时间变化的局部费用函数的一组网络代理的总和。目标是跟踪最佳轨迹,使每个时刻的总成本最小化。我们的方法包括两个阶段的动态,其中第一个采样的一阶和二阶导数的本地成本周期性地构建一个估计的下降方向的最佳轨迹,和第二个使用这个估计和一个共识项,以驱动本地状态的时变解决方案,同时达成共识。第一部分是通过在离散时间框架中实施加权平均共识算法来进行的,第二部分是用连续时间动态来进行的。利用李雅普诺夫稳定性分析,得到了总费用梯度的一个渐近上界上界。这个界限的特征在于当地成本的性质。为了证明所提出的方法的性能,进行了一个数值例子,研究调整算法的参数和局部状态的收敛到最优轨迹的影响。

英文摘要:

In this paper, we propose a novel solution for the distributed unconstrained optimization problem where the total cost is the summation of time-varying local cost functions of a group networked agents. The objective is to track the optimal trajectory that minimizes the total cost at each time instant. Our approach consists of a two-stage dynamics, where the first one samples the first and second derivatives of the local costs periodically to construct an estimate of the descent direction towards the optimal trajectory, and the second one uses this estimate and a consensus term to drive local states towards the time-varying solution while reaching consensus. The first part is carried out by the implementation of a weighted average consensus algorithm in the discrete-time framework and the second part is performed with a continuous-time dynamics. Using the Lyapunov stability analysis, an upper bound on the gradient of the total cost is obtained which is asymptotically reached. This bound is characterized by the properties of the local costs. To demonstrate the performance of the proposed method, a numerical example is conducted that studies tuning the algorithm's parameters and their effects on the convergence of local states to the optimal trajectory.

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

↑