Dear Editor,This letter aims to establish a privacy-preserving distributed optimization algorithm by combining the consensus iteration by subgradients, which not only enables the privacy preservation of optimization b...Dear Editor,This letter aims to establish a privacy-preserving distributed optimization algorithm by combining the consensus iteration by subgradients, which not only enables the privacy preservation of optimization but also guarantees the optimality of solutions with some bias bounds.In the setting of distributed optimization, a network of nodes, having their own objective functions depending on the global agents' state, would like to distributedly optimize the sum of all objective functions through the local agent-to-agent information change.展开更多
Dear Editor,This letter aims to investigate the optimization problem where the decision variable is contained in a closed convex set.By combing the gradient decent-like method with the push-sum algorithm framework,we ...Dear Editor,This letter aims to investigate the optimization problem where the decision variable is contained in a closed convex set.By combing the gradient decent-like method with the push-sum algorithm framework,we design the distributed iterative formulas under the condition that the considered graphs sequence is time-varying and unbalanced.展开更多
In this paper,the optimization problem subject to N nonidentical closed convex set constraints is studied.The aim is to design a corresponding distributed optimization algorithm over the fixed unbalanced graph to solv...In this paper,the optimization problem subject to N nonidentical closed convex set constraints is studied.The aim is to design a corresponding distributed optimization algorithm over the fixed unbalanced graph to solve the considered problem.To this end,with the push-sum framework improved,the distributed optimization algorithm is newly designed,and its strict convergence analysis is given under the assumption that the involved graph is strongly connected.Finally,simulation results support the good performance of the proposed algorithm.展开更多
基金supported by the Science and Technology Project from State Grid Zhejiang Electric Power CO.Ltd(5211JY20001Q)。
文摘Dear Editor,This letter aims to establish a privacy-preserving distributed optimization algorithm by combining the consensus iteration by subgradients, which not only enables the privacy preservation of optimization but also guarantees the optimality of solutions with some bias bounds.In the setting of distributed optimization, a network of nodes, having their own objective functions depending on the global agents' state, would like to distributedly optimize the sum of all objective functions through the local agent-to-agent information change.
基金supported by the Science and Technology Project of State Grid Zhejiang Electric Power CO.,LTD.(5211JY19000X)。
文摘Dear Editor,This letter aims to investigate the optimization problem where the decision variable is contained in a closed convex set.By combing the gradient decent-like method with the push-sum algorithm framework,we design the distributed iterative formulas under the condition that the considered graphs sequence is time-varying and unbalanced.
基金Project supported by the Science and Technology Project from State Grid Zhejiang Electric Power Co.,Ltd.,China(No.5211JY20001Q)。
文摘In this paper,the optimization problem subject to N nonidentical closed convex set constraints is studied.The aim is to design a corresponding distributed optimization algorithm over the fixed unbalanced graph to solve the considered problem.To this end,with the push-sum framework improved,the distributed optimization algorithm is newly designed,and its strict convergence analysis is given under the assumption that the involved graph is strongly connected.Finally,simulation results support the good performance of the proposed algorithm.
