Pages that link to "Item:Q4594836"
From MaRDI portal
The following pages link to A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow (Q4594836):
Displaying 11 items.
- On the robustness and scalability of semidefinite relaxation for optimal power flow problems (Q779755) (← links)
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
- Alternating current optimal power flow with generator selection (Q1661909) (← links)
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem (Q1741115) (← links)
- A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
- AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization (Q2095185) (← links)
- A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids (Q2338485) (← links)
- A strengthened Barvinok-Pataki bound on SDP rank (Q2670438) (← links)
- Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow (Q2689820) (← links)
- Strong SOCP Relaxations for the Optimal Power Flow Problem (Q2957450) (← links)
- Mathematical programming formulations for the alternating current optimal power flow problem (Q5918757) (← links)