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

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

Cited in

(6)

• Convexification of generalized network flow problem
• A survey on conic relaxations of optimal power flow problem
• Hidden invariant convexity for global and conic-intersection optimality guarantees in discrete-time optimal control
• Strong NP-hardness of AC power flows feasibility
• Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow
• Derivative-enhanced lower-Bounding in adaptive discretization for the global solution of semi-infinite optimization problems

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)