AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization

DOI10.5802/ojmo.17zbMath1506.90209MaRDI QIDQ2095185

Antoine Oustry

Publication date: 9 November 2022

Published in: OJMO. Open Journal of Mathematical Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5802/ojmo.17

zbMATH Keywords

global optimization; semidefinite programming; mixed-integer linear programming; ACOPF

Mathematics Subject Classification ID

90C22: Semidefinite programming

90C11: Mixed integer programming

90C26: Nonconvex programming, global optimization

Uses Software

• CPLEX
• Mosek
• Ipopt
• Pyomo
• PGLib-OPF
• PowerModels.jl
• Gravity

Cites Work

• Unnamed Item
• Positive definite completions of partial Hermitian matrices
• Elementary proof for Sion's minimax theorem
• A new reformulation-linearization technique for bilinear programming problems
• A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
• Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Global Optimization with Polynomials and the Problem of Moments
• Strong SOCP Relaxations for the Optimal Power Flow Problem
• Feasibility-Based Bounds Tightening via Fixed Points
• Branching and bounds tighteningtechniques for non-convex MINLP
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
• Mathematical programming formulations for the alternating current optimal power flow problem