Abstract
In this paper, we report the experimental results on certifying 1% global optimality of solutions of AC-OPF instances from PGLiB with up to 24464 buses via the CS-TSSOS hierarchy - a moment-SOS based hierarchy that exploits both correlative and term sparsity, which can provide tighter SDP relaxations than Shor's relaxation. Our numerical experiments demonstrate that the CS-TSSOS hierarchy scales well with the problem size and is indeed useful in certifying 1% global optimality of solutions for large-scale real world problem; e.g., the AC-OPF problem. In particular, we are able to certify 1% global optimality for an AC-OPF instance with 6515 buses involving 14398 real variables and 63577 constraints.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
