A laplacian-based approach for finding near globally optimal solutions to OPF problems
A laplacian-based approach for finding near globally optimal solutions to OPF problems
A semidefinite programming (SDP) relaxation globally solves many optimal power flow (OPF) problems. For other OPF problems where the SDP relaxation only provides a lower bound on the objective value rather than the globally optimal decision variables, recent literature has proposed a penalization approach to find feasible points that are …