Abstract
By introducing a surplus variable, a distributed stochastic algorithm is developed for convex optimization problem based on directed communication graphs. Firstly, in the proposed distributed algorithm, a surplus variable is introduced to overcome the unbalance graphs and relaxing the stringent double stochastic matrix condition. Besides, by formulating row stochastic matrix for decision variable and column stochastic matrix for surplus variable, we prove that the convergence rate of the proposed algorithm is $\mathcal{O}\left( {\ln k/k} \right)$. Finally, for the purpose of showing the effectiveness of the proposed method, a numerical example are presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
