Pages that link to "Item:Q779755"
From MaRDI portal
The following pages link to On the robustness and scalability of semidefinite relaxation for optimal power flow problems (Q779755):
Displaying 11 items.
- TRIPODS/MOPTA 2018 special issue on energy and optimization (Q779753) (← links)
- Global optimization for optimal power flow over transmission networks (Q1683333) (← links)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- Bregman primal-dual first-order method and application to sparse semidefinite programming (Q2070334) (← links)
- A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems (Q2124197) (← links)
- A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids (Q2338485) (← links)
- A semismooth Newton method for solving optimal power flow (Q2468868) (← links)
- Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow (Q2689820) (← links)
- A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow (Q4594836) (← links)
- Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow (Q6060145) (← links)
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization (Q6599983) (← links)
