arXiv 0907.45182009-07math.OCmath.CO

A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs

João Gouveia, Monique Laurent, Pablo A. Parrilo, Rekha Thomas

备注：: 23 pages. To appear in Math. Programming
发表信息：: Mathematical Programming, Volume 133, Numbers 1-2, pp. 203-225, (2012)
DOI：: 10.1007/s10107-010-0425-z

英文摘要：

The theta bodies of a polynomial ideal are a series of semidefinite programming relaxations of the convex hull of the real variety of the ideal. In this paper we construct the theta bodies of the vanishing ideal of cycles in a binary matroid. Applied to cuts in graphs, this yields a new hierarchy of semidefinite programming relaxations of the cut polytope of the graph. If the binary matroid avoids certain minors we can characterize when the first theta body in the hierarchy equals the cycle polytope of the matroid. Specialized to cuts in graphs, this result solves a problem posed by Lovász.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

正定锥的稀疏切割

Sparse Cuts for the Positive Semidefinite Cone

Georgia Tech（佐治亚理工学院）；Cornell Tech（康奈尔科技）；U. Wisconsin-Madison（威斯康星大学麦迪逊分校）

本文提出了一种基于稀疏线性不等式的LP松弛方法，用于解决非凸优化问题，通过结构化SDP投影识别不等式，从而加速全局求解过程。

2026-09-01math.OC

最优Max-Cut SDP解的几何结构

Optimal Cuts and Optimal Faces of Exact Max-Cut Semidefinite Relaxations

Indian Institute of Technology Bombay（印度理工学院孟买分校）；The Ohio State University（俄亥俄州立大学）

本文研究Max-Cut半定松弛精确时最优割符号向量张成对偶松弛核的条件，证明双非负矩阵经偶数复制可作证书，并刻画有理核障碍与张成亏缺。

2026-10-14math.OC

复割多面体的割与半定提升

Cuts and semidefinite liftings for the complex cut polytope

研究复割多面体，将其有效割推广至有限 $m>2$ 的情形并提供比较框架，同时提出 $m=\infty$ 时的第二半定提升，证明其等价于同阶复 Lasserre 型提升且尺寸更小。

2024-08-23math.OC

半定规划的谱规范割平面法

Spectral-gauge cuts for semidefinite programming

CMA, Mines Paris – PSL（巴黎高等矿业学校-巴黎文理研究大学）

研究半定规划，运用对称规范理论开发割平面算法，基于谱归一化制定分离问题并推导预言机，嵌入凯利方法，通过数值实验验证框架在盒约束二次规划和稀疏主成分分析中的通用性与性能。

2026-07-08math.OCmath.SP

Certifying Global Optimality of Graph Cuts via Semidefinite Relaxation: A Performance Guarantee for Spectral Clustering

Courant Institute of Mathematical Sciences, New York University（纽约大学库朗数学科学研究所）；University of California at Davis（加州大学戴维斯分校）

Spectral clustering has become one of the most widely used clustering techniques when the structure of the individual clusters is non-convex or highly anisotropic. Yet, despite its immense popularity, there exists fairly little theory about performance guarantees for spectral clustering. This issue is partly due to the fact that spectral clustering typically involves two steps which complicated its theoretical analysis: first, the eigenvectors of the associated graph Laplacian are used to embed the dataset, and second, k-means clustering algorithm is applied to the embedded dataset to get the …

2019-04-14cs.ITcs.LGmath.IT

Benders' decomposition of the unit commitment problem with semidefinite relaxation of AC power flow constraints

In this paper we present a formulation of the unit commitment problem with AC power flow constraints. It is solved by a Benders decomposition in which the unit commitment master problem is formulated as a mixed-integer problem with linearization of the power generation constraints for improved convergence. Semidefinite programming relaxation of the rectangular AC optimal power flow is used in the subproblem, providing somewhat conservative cuts. Numerical case studies, including a 6-bus and the IEEE 118-bus network, are provided to test the effectiveness of our proposal. We show in our numeric…

2020-11-23math.OC

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

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

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.

2016-01-05math.OC

最大割与分数割覆盖：一种随机半定规划方法的计算研究

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach

本文研究一种同时近似最大割和加权分数割覆盖问题的对偶框架，通过半定规划松弛和随机超平面技术实现近 optimality 证明，达到 Goemans 和 Williamson 的 0.878 约束比。

2026-04-19cs.DMmath.OC

协方差秩取整与拟阵边覆盖矩提升的紧整度间隙

Covariance-Rank Rounding and a Sharp Integrality Gap for a Matroid Edge-Coverage Moment Lift

UC Irvine（加州大学尔湾分校）

该研究针对拟阵边覆盖的半定松弛问题，提出基于协方差秩的确定性多项式时间取整方法，证明其倒数整度间隙为4/3，且配对排除不等式可使该族问题的取整结果精确。

2026-10-14math.OC

Linear Programming Relaxations of Quadratically Constrained Quadratic Programs

We investigate the use of linear programming tools for solving semidefinite programming relaxations of quadratically constrained quadratic problems. Classes of valid linear inequalities are presented, including sparse PSD cuts, and principal minors PSD cuts. Computational results based on instances from the literature are presented.

2012-06-07cs.DMmath.COmath.OC

Strengthened SDP Relaxation for an Extended Trust Region Subproblem with an Application to Optimal Power Flow

We study an extended trust region subproblem minimizing a nonconvex function over the hollow ball $r \le \|x\| \le R$ intersected with a full-dimensional second order cone (SOC) constraint of the form $\|x - c\| \le b^T x - a$. In particular, we present a class of valid cuts that improve existing semidefinite programming (SDP) relaxations and are separable in polynomial time. We connect our cuts to the literature on the optimal power flow (OPF) problem by demonstrating that previously derived cuts capturing a convex hull important for OPF are actually just special cases of our cuts. In additio…

2021-07-29math.OC

SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs

We consider the global optimization of nonconvex mixed-integer quadratic programs with linear equality constraints. In particular, we present a new class of convex quadratic relaxations which are derived via quadratic cuts. To construct these quadratic cuts, we solve a separation problem involving a linear matrix inequality with a special structure that allows the use of specialized solution algorithms. Our quadratic cuts are nonconvex, but define a convex feasible set when intersected with the equality constraints. We show that our relaxations are an outer-approximation of a semi-infinite con…

2021-06-25math.OC

整数半定规划的 Chvátal-Gomory 过程及其在组合优化中的应用

The Chvátal-Gomory Procedure for Integer SDPs with Applications in Combinatorial Optimization

本文研究整数半定规划的 CG 割理论与分离方法，并将其用于 QTSP 的分支切割求解，显著提升了大规模实例的最优求解能力。

2023-09-26math.OC

投影切割平面法求解半定规划

Semidefinite Programming by Projective Cutting Planes

本文提出投影切割平面法求解半定规划，通过高效求解投影子问题生成内外解序列，收敛到最优，在大型矩阵上超越现有软件。

2023-11-15cs.MScs.NAmath.NA

具有传输约束的机组启停问题

Transmission-Constrained Unit Commitment

本文提出基于混合整数二次规划和半正定规划分解的方法，解决具有传输约束的交流模型中的机组启停问题，并在西班牙加那利群岛测试案例中取得良好效果。

2018-06-25cs.SYeess.SYmath.OC

次模盒约束二次规划的Ω(n) SDP松弛间隙研究

On the $Ω(n)$ SDP relaxation gap for Submodular Box-Constrained Quadratic Programming

National University of Singapore（新加坡国立大学）

本文研究次模盒约束二次规划的SDP松弛间隙，证明n≥4时SDP松弛存在正松弛间隙，给出不同线性割下的间隙下界，揭示SDP松弛的局限性并为凸近似提供指导。

2026-09-09math.OC

一种基于变分量子本征求解器的半定规划问题割平面框架

A variational quantum eigensolver-based cutting plane framework for semidefinite programming problems

Bilkent University（比尔肯特大学）；Sabancı University（萨贝里大学）；Rensselaer Polytechnic Institute（伦斯勒理工学院）

本研究提出基于变分量子本征求解器的半定规划割平面框架，在SDPLIB控制族数据集上，其最优性间隙闭合率达32%-82%，揭示了混合量子-经典方法的相关效应。

2026-09-03math.OCquant-ph

紧凑的提升松弛方法用于低秩优化

Compact Lifted Relaxations for Low-Rank Optimization

Department of Analytics, Marketing and Operations, Imperial Business School（分析、营销与运营部，帝国商业学院）；Management Science and Operations, London Business School（管理科学与运营，伦敦商业学院）

本文提出了一种可处理秩约束二次优化问题的紧凑凸松弛方法，通过引入提升半正定松弛，避免了传统方法中所需的谱结构项，并通过冗余块的分析得到更紧凑的松弛形式，同时引入了新的有效不等式（投影割）以增强低秩松弛效果，适用于矩阵补全和降维回归等问题。

2026-05-20cs.LGmath.OC

基数约束最小平方和聚类的半定规划全局优化

Global Optimization for Cardinality-constrained Minimum Sum-of-Squares Clustering via Semidefinite Programming

Sapienza University of Rome（罗马第一大学）

针对基数约束的最小平方和聚类，提出基于分支切割和新型半定规划松弛的全局优化方法，并辅以局部搜索，首次求解比现有精确方法大10倍的现实实例。

2023-09-07cs.LGmath.OCstat.ML

通过投影进行划分：大规模图划分问题的强SDP界

Partitioning through projections: strong SDP bounds for large graph partition problems

本文研究通过面缩减和割平面算法求解图划分问题的双重非负松弛，首次在多达1024个顶点的大规模基准实例上验证了附加割平面的DNN松弛的强大能力，显著提升了边界质量。

2022-09-19math.OC