Fetching the paper…
Reading the bibliography…
This article develops a strengthened convex quadratic convex (QC) relaxation of the AC Optimal Power Flow (AC-OPF) problem and presents an optimization-based bound-tightening (OBBT) algorithm to compute tight, feasible bounds on the voltage magnitude variables for each bus and the phase angle difference variables for each branch in the network.
Contribution a l’etude du dispatching economique
J Carpentier · 1962
Earlier work this paper cites.
Computability of global solutions to factorable nonconvex programs: Part i—convex underestimating problems
Garth P McCormick · 1976
Earlier work this paper cites.
A convex envelope formula for multilinear functions
Anatoliy D Rikun · 1997
Earlier work this paper cites.
Radial distribution load flow using conic programming
Rabih A Jabr · 2006
Earlier work this paper cites.
On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming
A. Wächter and L. T. Biegler · 2006
Earlier work this paper cites.
Semidefinite programming for optimal power flow problems
Xiaoqing Bai, Hua Wei, Katsuki Fujisawa, and Yong Wang · 2008
Earlier work this paper cites.
Optimal power flow: a bibliographic survey ii
Stephen Frank, Ingrida Steponavice, and Steffen Rebennack · 2012
Earlier work this paper cites.
Moment-based relaxation of the optimal power flow problem
Daniel K Molzahn and Ian A Hiskens · 2014
Earlier work this paper cites.
Strong NP-hardness of AC power flows feasibility
Daniel Bienstock and Abhinav Verma · 2015
Earlier work this paper cites.
Strengthening convex relaxations with bound tightening for power network optimization
Carleton Coffrin, Hassan L Hijazi, and Pascal Van Hentenryck · 2015
Cited alongside, same era.
Bound tightening for the alternating current optimal power flow problem
Chen Chen, Alper Atamtürk, and Shmuel S Oren · 2016
Cited alongside, same era.
The QC Relaxation: A Theoretical and Computational Study on Optimal Power Flow
C. Coffrin, H. L. Hijazi, and P. Van Hentenryck · 2016
Cited alongside, same era.
Global optimization methods for optimal power flow and transmission switching problems in electric power systems
Burak Kocuk · 2016
Cited alongside, same era.
AC-feasibility on tree networks is NP-hard
Karsten Lehmann, Alban Grastien, and Pascal Van Hentenryck · 2016
Cited alongside, same era.
Tightening McCormick relaxations for nonlinear programs via dynamic multivariate partitioning
Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
Yash Puranik and Nikolaos V Sahinidis · 2017
Later among the works it cites.
Powermodels.jl: An open-source framework for exploring power flow formulations
Carleton Coffrin, Russell Bent, Kaarthik Sundar, Yeesian Ng, and Miles Lubin · 2018
Closest in time.
Convex relaxations in power system optimization: A brief introduction
Carleton Coffrin and Line Roald · 2018
Closest in time.
Gurobi optimizer reference manual, 2018
Gurobi · 2018
Closest in time.
Tight piecewise convex relaxations for global optimization of optimal power flow
Mowen Lu, Harsha Nagarajan, Russell Bent, Sandra Eksioglu, and Scott Mason · 2018
Closest in time.
Convex hull formulations for mixed-integer multilinear functions
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Harsha Nagarajan, Mowen Lu, Emre Yamangil, and Russell Bent · 2016
Cited alongside, same era.
Strengthening the SDP relaxation of AC power flows with convex envelopes, bound tightening, and valid inequalities
C. Coffrin, H. L. Hijazi, and P. Van Hentenryck · 2017
Cited alongside, same era.
JuMP: A modeling language for mathematical optimization
Iain Dunning, Joey Huchette, and Miles Lubin · 2017
Cited alongside, same era.
Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
Hassan Hijazi, Carleton Coffrin, and Pascal Van Hentenryck · 2017
Cited alongside, same era.
Global solution strategies for the network-constrained unit commitment problem with ac transmission constraints
Jianfeng Liu, Anya Castillo, Jean-Paul Watson, and Carl D. Laird
Cited in the paper.
Harsha Nagarajan, Kaarthik Sundar, Hassan Hijazi, and Russell Bent · 2018
Closest in time.
Comparison of Various Trilinear Monomial Envelopes for Convex Relaxations of Optimal Power Flow Problems
M. R. Narimani, D. K. Molzahn, H. Nagarajan, and M. L. Crow · 2018
Closest in time.
PGLib Optimal Power Flow Benchmarks
The IEEE PES Task Force on Benchmarks for Validation of Emerging Power System Algorithms · 2018
Closest in time.
An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
Harsha Nagarajan, Mowen Lu, Site Wang, Russell Bent, and Kaarthik Sundar · 2019
Closest in time.