Convex quadratic relaxations for mixed-integer nonlinear programs in power systems

DOI10.1007/S12532-016-0112-ZzbMath1387.90158OpenAlexW2530360123MaRDI QIDQ1688449

Carleton Coffrin, Pascal Van Hentenryck, Hassan Hijazi

Publication date: 8 January 2018

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://www.osti.gov/biblio/1469547

zbMATH Keywords

global optimizationconvex relaxationmixed integer nonlinear programmingoptimal power flowcapacitor placementoptimal transmission switching

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (20)

Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ Approximations for generalized unsplittable flow on paths with application to power systems optimization ⋮ Strong SOCP Relaxations for the Optimal Power Flow Problem ⋮ Convexification of generalized network flow problem ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ Quantitative Models for Infrastructure Restoration After Extreme Events: Network Optimization Meets Scheduling ⋮ Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem ⋮ Disjunctive linear separation conditions and mixed-integer formulations for aircraft conflict resolution ⋮ An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs ⋮ Mathematical programming formulations for the alternating current optimal power flow problem ⋮ Mathematical programming formulations for the alternating current optimal power flow problem ⋮ Quadratic optimization with switching variables: the convex hull for \(n=2\) ⋮ Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching ⋮ A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching ⋮ Small and strong formulations for unions of convex sets from the Cayley embedding ⋮ An overview of semidefinite relaxations for optimal power flow problem ⋮ On the robustness and scalability of semidefinite relaxation for optimal power flow problems ⋮ Transmission system repair and restoration ⋮ Large-scale unit commitment under uncertainty ⋮ Operations research in optimal power flow: a guide to recent and emerging methodologies and applications

Uses Software

• HSL
• SCIP
• AMPL
• SDPT3
• Gurobi
• Couenne
• YALMIP
• Benchmarks for Optimization Software
• Bonmin
• Ipopt
• MATPOWER
• MA27
• NESTA

Cites Work

• Unnamed Item
• Mixed-integer nonlinear programs featuring ``on/off constraints
• SCIP: solving constraint integer programs
• An algorithmic framework for convex mixed integer nonlinear programs
• Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
• Using mixed-integer programming to solve power grid blackout problems
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Perspective reformulations of mixed integer nonlinear programs with indicator variables
• Lagrangian Duality and Branch-and-Bound Algorithms for Optimal Power Flow
• A Linear-Programming Approximation of AC Power Flows
• Spatial and Objective Decompositions for Very Large SCAPs
• The $N-k$ Problem in Power Grids: New Models, Formulations, and Numerical Experiments
• Jointly Constrained Biconvex Programming
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Reduction constraints for the global optimization of NLPs

This page was built for publication: Convex quadratic relaxations for mixed-integer nonlinear programs in power systems