Distributed algorithms for convexified bad data and topology error detection and identification problems

Yang Weng, Marija D. Ilić, Qiao Li, Rohit Negi

Research output: Contribution to journalArticlepeer-review

14 Scopus citations


Large-scale smart grids call for online algorithms that are able to achieve the most accurate estimates. This paper shows how to achieve both the scalability and near globally optimal results for bad data and topology error detection and identification problems, by conducting fully distributed algorithms over convexified problem formulations. The proposed distributed decomposition is realized by (1) reducing a large network into much smaller network "cliques" which do not need extensive information exchange; (2) performing a Lagrangian dual decomposition in each clique and passing messages between cliques; and (3) conducting alternative coordinate descent optimization for robustness. To reduce the relaxation error in the convexification procedure, a nuclear norm penalty is added to approximate original problems. Finally, we propose a new metric to evaluate detection and identification results, which enables a system operator to characterize confidence for further system operations. We show that the proposed algorithms can be realized on IEEE test systems with improved accuracy in a short time.

Original languageEnglish (US)
Pages (from-to)241-250
Number of pages10
JournalInternational Journal of Electrical Power and Energy Systems
StatePublished - Dec 1 2016
Externally publishedYes


  • Bad data and topology error
  • Convexification
  • Detection and identification
  • Distributed algorithms
  • Power systems
  • Semidefinite programming

ASJC Scopus subject areas

  • Energy Engineering and Power Technology
  • Electrical and Electronic Engineering


Dive into the research topics of 'Distributed algorithms for convexified bad data and topology error detection and identification problems'. Together they form a unique fingerprint.

Cite this