Computational Analysis of Sparsity-Exploiting Moment Relaxations of the OPF Problem. Molzahn, D. K., Hiskens, I. A., Josz, C., & Panciatici, P. In 19th Power Systems Computation Conference (PSCC), pages 1-7, June, 2016.
Computational Analysis of Sparsity-Exploiting Moment Relaxations of the OPF Problem [pdf]Paper  Computational Analysis of Sparsity-Exploiting Moment Relaxations of the OPF Problem [link]Link  Computational Analysis of Sparsity-Exploiting Moment Relaxations of the OPF Problem [link]Arxiv  doi  abstract   bibtex   
With the potential to find global solutions, significant research interest has focused on convex relaxations of the non-convex OPF problem. Recently, "moment-based" relaxations from the Lasserre hierarchy for polynomial optimization have been shown capable of globally solving a broad class of OPF problems. Global solution of many large-scale test cases is accomplished by exploiting sparsity and selectively applying the computationally intensive higher-order relaxation constraints. Previous work describes an iterative algorithm that indicates the buses for which the higher-order constraints should be enforced. In order to speed computation of the moment relaxations, this paper provides a study of the key parameter in this algorithm as applied to relaxations from both the original Lasserre hierarchy and a recent complex extension of the Lasserre hierarchy.
@inproceedings{molzahn_josz_hiskens_pantiatici-pscc2016,
	author={D. K. Molzahn and I. A. Hiskens and C. Josz and P. Panciatici},
	booktitle={19th Power Systems Computation Conference (PSCC)},
	title={{Computational Analysis of Sparsity-Exploiting Moment Relaxations of the OPF Problem}},
	year={2016},
	pages={1-7},
	month={June},
	doi={10.1109/PSCC.2016.7540831},
	keywords={Optimal Power Flow},
		abstract={With the potential to find global solutions, significant research interest has focused on convex relaxations of the non-convex OPF problem. Recently, "moment-based" relaxations from the Lasserre hierarchy for polynomial optimization have been shown capable of globally solving a broad class of OPF problems. Global solution of many large-scale test cases is accomplished by exploiting sparsity and selectively applying the computationally intensive higher-order relaxation constraints. Previous work describes an iterative algorithm that indicates the buses for which the higher-order constraints should be enforced. In order to speed computation of the moment relaxations, this paper provides a study of the key parameter in this algorithm as applied to relaxations from both the original Lasserre hierarchy and a recent complex extension of the Lasserre hierarchy.},
	url_Paper={molzahn_josz_hiskens_pantiatici-pscc2016.pdf},
	url_Link={http://ieeexplore.ieee.org/document/7540831/},
	url_arXiv={https://arxiv.org/abs/1603.05188},
}
Downloads: 0