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

基于鞍点动力学的非光滑凸优化分布式协调

Distributed coordination for nonsmooth convex optimization via saddle-point dynamics

Simon K. Niederländer, Jorge Cortés

摘要:

本文考虑连续时间协调算法的代理网络,寻求集体解决一般类的非光滑凸优化问题与固有的分布式结构。我们的算法设计建立在非光滑凸规划的解作为增广拉格朗日量的鞍点的特征上。我们表明,相关的鞍点动力学是渐近正确的,但在一般情况下,不分布,因为存在一个全球罚参数。这促使设计一个不连续的鞍点样算法,享有相同的收敛性能,是完全服从分布式实现。我们的收敛性证明依赖于一个新的全球李雅普诺夫函数的鞍点动态识别。这种新颖性也使我们能够确定温和的凸性和正则性条件的目标函数,保证指数收敛速度的凸优化问题的等式约束的算法。各种例子说明了我们的讨论。

英文摘要:

This paper considers continuous-time coordination algorithms for networks of agents that seek to collectively solve a general class of nonsmooth convex optimization problems with an inherent distributed structure. Our algorithm design builds on the characterization of the solutions of the nonsmooth convex program as saddle points of an augmented Lagrangian. We show that the associated saddle-point dynamics are asymptotically correct but, in general, not distributed because of the presence of a global penalty parameter. This motivates the design of a discontinuous saddle-point-like algorithm that enjoys the same convergence properties and is fully amenable to distributed implementation. Our convergence proofs rely on the identification of a novel global Lyapunov function for saddle-point dynamics. This novelty also allows us to identify mild convexity and regularity conditions on the objective function that guarantee the exponential convergence rate of the proposed algorithms for convex optimization problems subject to equality constraints. Various examples illustrate our discussion.

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

↑