@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},
}

{"_id":"xr5WfB9zgWpz4yG4b","bibbaseid":"molzahn-hiskens-josz-panciatici-computationalanalysisofsparsityexploitingmomentrelaxationsoftheopfproblem-2016","downloads":0,"creationDate":"2017-07-03T03:09:03.792Z","title":"Computational Analysis of Sparsity-Exploiting Moment Relaxations of the OPF Problem","author_short":["Molzahn, D. K.","Hiskens, I. A.","Josz, C.","Panciatici, P."],"year":2016,"bibtype":"inproceedings","biburl":"http://molzahn.github.io/pubs/molzahn.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["D.","K."],"propositions":[],"lastnames":["Molzahn"],"suffixes":[]},{"firstnames":["I.","A."],"propositions":[],"lastnames":["Hiskens"],"suffixes":[]},{"firstnames":["C."],"propositions":[],"lastnames":["Josz"],"suffixes":[]},{"firstnames":["P."],"propositions":[],"lastnames":["Panciatici"],"suffixes":[]}],"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","bibtex":"@inproceedings{molzahn_josz_hiskens_pantiatici-pscc2016,\r\n\tauthor={D. K. Molzahn and I. A. Hiskens and C. Josz and P. Panciatici},\r\n\tbooktitle={19th Power Systems Computation Conference (PSCC)},\r\n\ttitle={{Computational Analysis of Sparsity-Exploiting Moment Relaxations of the OPF Problem}},\r\n\tyear={2016},\r\n\tpages={1-7},\r\n\tmonth={June},\r\n\tdoi={10.1109/PSCC.2016.7540831},\r\n\tkeywords={Optimal Power Flow},\r\n\t\tabstract={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.},\r\n\turl_Paper={molzahn_josz_hiskens_pantiatici-pscc2016.pdf},\r\n\turl_Link={http://ieeexplore.ieee.org/document/7540831/},\r\n\turl_arXiv={https://arxiv.org/abs/1603.05188},\r\n}\r\n\r\n","author_short":["Molzahn, D. K.","Hiskens, I. A.","Josz, C.","Panciatici, P."],"key":"molzahn_josz_hiskens_pantiatici-pscc2016","id":"molzahn_josz_hiskens_pantiatici-pscc2016","bibbaseid":"molzahn-hiskens-josz-panciatici-computationalanalysisofsparsityexploitingmomentrelaxationsoftheopfproblem-2016","role":"author","urls":{" paper":"http://molzahn.github.io/pubs/molzahn_josz_hiskens_pantiatici-pscc2016.pdf"," link":"http://ieeexplore.ieee.org/document/7540831/"," arxiv":"https://arxiv.org/abs/1603.05188"},"keyword":["Optimal Power Flow"],"metadata":{"authorlinks":{"molzahn, d":"https://molzahn.github.io/"}}},"search_terms":["computational","analysis","sparsity","exploiting","moment","relaxations","opf","problem","molzahn","hiskens","josz","panciatici"],"keywords":["optimal power flow"],"authorIDs":["59582200cbabf16e64000007","624j9FtXSKkfgyPrh"],"dataSources":["N9RbYQXQQNeKPxcpP"]}