Generating cutting planes for the semidefinite relaxation of quadratic programs
From MaRDI portal
Publication:337405
DOI10.1016/j.cor.2014.09.008zbMath1348.90515OpenAlexW1979163460MaRDI QIDQ337405
Riadh Zorgati, Abdel Lisser, Agnès Gorge
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.09.008
Related Items (3)
On linear programming relaxations for solving polynomial programming problems ⋮ Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes ⋮ A new algorithm for concave quadratic programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stochastic nuclear outages semidefinite relaxations
- Handbook on semidefinite, conic and polynomial optimization
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Extending the QCR method to general mixed-integer programs
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Moments and sums of squares for polynomial optimization and related problems
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Applications of second-order cone programming
- Optimizing nuclear power plant refueling with mixed-integer programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Applications of semidefinite programming
- Semidefinite programming relaxation for nonconvex quadratic programs
- A semidefinite programming approach to the quadratic knapsack problem
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Application of cut polyhedra. I
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Partial Lagrangian relaxation for general quadratic programming
- Global Optimization with Polynomials and the Problem of Moments
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Numerical Study of Semidefinite Bounds for the k-cluster Problem
- The perfectly matchable subgraph polytope of a bipartite graph
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Semidefinite optimization
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- Approximate graph coloring by semidefinite programming
- Quadratically constrained quadratic programming: Some applications and a method for solution
- Cones of Matrices and Set-Functions and 0–1 Optimization
- On the Shannon capacity of a graph
- Linear Matrix Inequalities in System and Control Theory
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- Surrogate Constraints
- A Survey of the S-Lemma
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Introduction to global optimization.
This page was built for publication: Generating cutting planes for the semidefinite relaxation of quadratic programs
