摘要：AbstractThis work addresses the problem of solving distributed optimization problems over directed graphs. Using techniques from geometric control theory, a novel methodology is proposed to design continuous-time distributed algorithms that approximate the solutions to the saddle-point algorithms over directed graphs. Graph-theoretic conditions are established under which the proposed methodology provides a distributed solution.
关键词：Keywordsdistributed optimizationdirected graphssaddle point algorithmsLie brackets
