Convex Restriction of Power Flow Feasibility Sets

DOI10.1109/TCNS.2019.2930896MaRDI QIDQ5211913zbMATH OpenOpenAlexWikidataFDO

Authors Dongchan Lee, Hung D. Nguyen, Krishnamurthy Dvijotham, Konstantin S. Turitsyn

Publication date 28 January 2020

Published in IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1803.00818

Mathematics Subject Classification ID

Systems theory; control (93-XX) Operations research, mathematical programming (90-XX)

Cited in

(5)

• Strong NP-hardness of AC power flows feasibility
• Hidden invariant convexity for global and conic-intersection optimality guarantees in discrete-time optimal control
• A survey on conic relaxations of optimal power flow problem
• Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow
• Convexification of generalized network flow problem

This page was built for publication: Convex Restriction of Power Flow Feasibility Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211913)