Average Quasi-Consensus Algorithm for Distributed Constrained Optimization: Impulsive Communication Framework Academic Article uri icon

abstract

  • This paper presents the impulsive average quasi-consensus algorithm for distributed constrained convex optimization. First, the constrained optimization problem can be transformed into an unconstrained problem using the interior point method, and then a distributed algorithm is modeled by means of impulsive differential equation. In the framework of the continuous-time gradient method and algebraic graph theory, each agent can deal with one local objective function with local constraints. At the impulsive instants, each agent can communicate with its neighboring agents over the network. Under certain conditions, the impulsive average quasi-consensus is achieved. It is shown that the state of average quasi-consensus is the optimal solution of the aforementioned unconstrained optimization problem, and the state of each agent can also reach the neighborhood of the optimal solution. Finally, two numerical examples show the effectiveness of the proposed impulsive average quasi-consensus algorithm. Moreover, the feasibility of the approach is verified by an application to one sensor network localization problem.

author list (cited authors)

  • He, X., Yu, J., Huang, T., Li, C., & Li, C.

citation count

  • 10

publication date

  • January 2020