arXiv 1512.046442015-12math.OC

Strengthening the SDP Relaxation of AC Power Flows with Convex Envelopes, Bound Tightening, and Lifted Nonlinear Cuts

Carleton Coffrin, Hassan Hijazi, Pascal Van Hentenryck

备注：: arXiv admin note: text overlap with arXiv:1502.07847

英文摘要：

This paper considers state-of-the-art convex relaxations for the AC power flow equations and introduces new valid cuts based on convex envelopes and lifted nonlinear constraints. These valid linear inequalities strengthen existing semidefinite and quadratic programming relaxations and dominate existing cuts proposed in the litterature. Together with model intersections and bound tightening, the new linear cuts close 8 of the remaining 16 open test cases in the NESTA archive for the AC Optimal Power Flow problem.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

提升公式中的界收紧：基于RLT的算法中（子）求解器依赖的性能影响

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms

University of Santiago de Compostela（圣地亚哥-德孔波斯特拉大学）；CITMAga (Galician Center for Mathematical Research and Technology)（加利西亚数学研究与技术中心）；University of Vigo（维戈大学）

本文研究全局优化中变量界传播到RLT提升空间辅助变量对分支定界性能的影响，给出辅助变量隐式界的理论结果，并通过计算实验评估显式界传播对RLT算法性能的影响程度。

2026-10-07math.OC

Inexactness of SDP Relaxation and Valid Inequalities for Optimal Power Flow

It has been recently proven that the semidefinite programming (SDP) relaxation of the optimal power flow problem over radial networks is exact under technical conditions such as not including generation lower bounds or allowing load over-satisfaction. In this paper, we investigate the situation where generation lower bounds are present. We show that even for a two-bus one-generator system, the SDP relaxation can have all possible approximation outcomes, that is (1) SDP relaxation may be exact or (2) SDP relaxation may be inexact or (3) SDP relaxation may be feasible while the OPF instance may …

2014-12-18math.OC

Handling Hard Affine SDP Shape Constraints in RKHSs

INRIA（法国国家信息与自动化研究所）；Département d’Informatique de l’École Normale Supérieure（巴黎高等师范学院计算机系）；PSL Research University（巴黎文理研究大学）；London School of Economics（伦敦政治经济学院）

Shape constraints, such as non-negativity, monotonicity, convexity or supermodularity, play a key role in various applications of machine learning and statistics. However, incorporating this side information into predictive models in a hard way (for example at all points of an interval) for rich function classes is a notoriously challenging problem. We propose a unified and modular convex optimization framework, relying on second-order cone (SOC) tightening, to encode hard affine SDP constraints on function derivatives, for models belonging to vector-valued reproducing kernel Hilbert spaces (v…

2022-11-20cs.LGmath.OCstat.ML

稀疏盒约束二次规划的紧半正定规划松弛

Tight semidefinite programming relaxations for sparse box-constrained quadratic programs

Lehigh University（利哈伊大学）

本文提出了一种基于重构线性化技术的紧半正定规划松弛方法，用于解决稀疏盒约束二次规划问题，并给出了多项式规模的可构造性证明。

2026-10-14math.OC

混合整数多项式电网优化的低秩与提升半定规划

Low-Rank and Lifted Semidefinite Programming for Mixed-Integer Polynomial Power Grid Optimization

University of Vermont（佛蒙特大学）

本文提出将低秩半定规划与基于矩的松弛收紧相结合，用于求解交流最优输电切换问题，并通过原始-对偶目标一致性和原始可行性验证，获得全局最优解，可作为分支定界法的可扩展替代方案。

2026-10-01cs.SYeess.SYmath.OC

关于直接转矩有限控制集模型预测控制的SDP松弛

On the SDP Relaxation of Direct Torque Finite Control Set Model Predictive Control

本文提出长时域直接转矩有限控制集模型预测控制的半定规划松弛，结合早停分支定界提取候选输入序列，仿真表明该方法显著改善转矩瞬态。

2024-12-16cs.SYeess.SYmath.OC

更多相关论文收起更多论文

一种结合团图合并策略的增强半定松弛模型用于高效交流最优潮流求解

An Enhanced Semidefinite Relaxation Model Combined with Clique Graph Merging Strategy for Efficient AC Optimal Power Flow Solution

本文提出一种增强半定松弛模型，整合λ二次凸松弛、有效不等式、边界收紧算法及团图合并策略，以更紧下界和更高效率求解交流最优潮流，并在大规模算例上验证了有效性。

2024-09-29cs.SYeess.SYmath.OC

Optimization on linear matrix inequalities for polynomial systems control

Many problems of systems control theory boil down to solving polynomial equations, polynomial inequalities or polyomial differential equations. Recent advances in convex optimization and real algebraic geometry can be combined to generate approximate solutions in floating point arithmetic. In the first part of the course we describe semidefinite programming (SDP) as an extension of linear programming (LP) to the cone of positive semidefinite matrices. We investigate the geometry of spectrahedra, convex sets defined by linear matrix inequalities (LMIs) or affine sections of the SDP cone. We als…

2013-09-12math.OC

针对二元与混合二元优化问题半定松弛的仿射 facial 归约

Affine Facial Reduction for Semidefinite Relaxations of Binary and Mixed-Binary Optimization Problems

Clemson University（克莱姆森大学）

本文提出仿射 facial 归约（affine FR）方法，用于二元与混合二元优化问题的 SDP 松弛，可降低矩阵阶数，在 MIPLIB 2017 实例上表现优于部分 FR 变体，还能改善 SAT 松弛的求解效果。

2026-09-04math.OC

Matrix Minor Reformulation and SOCP-based Spatial Branch-and-Cut Method for the AC Optimal Power Flow Problem

Alternating current optimal power flow (AC OPF) is one of the most fundamental optimization problems in electrical power systems. It can be formulated as a semidefinite program (SDP) with rank constraints. Solving AC OPF, that is, obtaining near optimal primal solutions as well as high quality dual bounds for this non-convex program, presents a major computational challenge to today's power industry for the real-time operation of large-scale power grids. In this paper, we propose a new technique for reformulation of the rank constraints using both principal and non-principal 2-by-2 minors of t…

2017-03-08math.OC

Parametric Convex Quadratic Relaxation of the Quadratic Knapsac Problem

We consider a parametric convex quadratic programming, CQP, relaxation for the quadratic knapsack problem, QKP. This relaxation maintains partial quadratic information from the original QKP by perturbing the objective function to obtain a concave quadratic term. The nonconcave part generated by the perturbation is then linearized by a standard approach that lifts the problem to the matrix space. We present a primal-dual interior point method to optimize the perturbation of the quadratic function, in a search for the tightest upper bound for the \QKPp. We prove that the same perturbation approa…

2019-06-10math.OC

基于双线性Koopman实现与比例误差界的收缩模型预测控制

Contraction-Based Model Predictive Control using Bilinear Koopman Realizations with Proportional Error Bounds

The University of Tokyo（东京大学）

本文提出一种基于双线性Koopman实现与比例误差界的鲁棒模型预测控制框架，通过重投影提升状态构建误差感知预测器，并利用同胚管收紧处理非线性约束，证明了约束满足、递归可行性与指数稳定性，数值实验显示其性能优于现有Koopman方法。

2026-09-29math.OC

优化遇上机器学习：半监督支持向量机的精确算法

Optimization meets Machine Learning: An Exact Algorithm for Semi-Supervised Support Vector Machines

Sapienza University of Rome（罗马第一大学）；Alpen-Adria-Universität Klagenfurt（克拉根福阿尔卑斯-亚得里亚大学）

提出一种基于半定规划松弛的分支定界算法精确求解非凸的半监督支持向量机（S3VMs），通过界限紧致化与有效不等式加强下界，并利用局部搜索获取上界，显著提升了求解规模与效率。

2024-11-25cs.LGmath.OC

一种用于带二进制约束的非光滑非线性优化的松弛方法

A Relaxation Method for Nonsmooth Nonlinear Optimization with Binary Constraints

College of Information Science and Technology, Jinan University（暨南大学信息科学技术学院）；Department of Data Science and Artificial Intelligence, The Hong Kong Polytechnic University（香港理工大学数据科学与人工智能系）；School of Mathematics, South China University of Technology（华南理工大学数学学院）

本文提出了一种基于凸性差的松弛算法，用于解决带二进制约束的非光滑非线性优化问题，通过全局复杂性保证和实验验证，展示了其在准确性和可扩展性上的优势。

2026-01-06math.OC