Skip to main navigation Skip to search Skip to main content

Global Optimization: A Distributed Compensation Algorithm and its Convergence Analysis

  • Wen-Ting Lin
  • , Yan-Wu Wang*
  • , Chaojie Li
  • , Jiang-Wen Xiao
  • *Corresponding author for this work

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

Abstract

This paper introduces a distributed compensation approach for the global optimization with separable objective functions and coupled constraints. By employing compensation variables, the global optimization problem can be solved without the information exchange of coupled constraints. The convergence analysis of the proposed algorithm is presented with the convergence condition through which a diminishing step-size with an upper bound can be determined. The convergence rate can be achieved at O(lnTT). Moreover, the equilibrium of this algorithm is proved to converge at the optimal solution of the global optimization problem. The effectiveness and the practicability of the proposed algorithm is demonstrated by the parameter optimization problem in smart building. © 2013 IEEE.
Original languageEnglish
Article number8708976
Pages (from-to)2355-2369
Number of pages15
JournalIEEE Transactions on Systems, Man, and Cybernetics: Systems
Volume51
Issue number4
Online published7 May 2019
DOIs
Publication statusPublished - Apr 2021
Externally publishedYes

Funding

This work was supported in part by the National Natural Science Foundation of China under Grant 61773172, Grant 61572210, and Grant 51537003, in part by the Natural Science Foundation of Hubei Province of China under Grant 2017CFA035, and in part by the Academic Frontier Youth Team of HUST.

Research Keywords

  • Compensation approach
  • coupled constraints
  • distributed optimization
  • global optimal

Fingerprint

Dive into the research topics of 'Global Optimization: A Distributed Compensation Algorithm and its Convergence Analysis'. Together they form a unique fingerprint.

Cite this