Generating cutting planes for the semidefinite relaxation of quadratic programs
From MaRDI portal
Publication:337405
DOI10.1016/J.COR.2014.09.008zbMATH Open1348.90515OpenAlexW1979163460MaRDI QIDQ337405FDOQ337405
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Linear Matrix Inequalities in System and Control Theory
- A Survey of the S-Lemma
- Global optimization with polynomials and the problem of moments
- Approximate graph coloring by semidefinite programming
- On the Shannon capacity of a graph
- Applications of second-order cone programming
- Application of cut polyhedra. I
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Semidefinite optimization
- Title not available (Why is that?)
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Applications of semidefinite programming
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Disjunctive programming: Properties of the convex hull of feasible points
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Introduction to global optimization.
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Quadratically constrained quadratic programming: Some applications and a method for solution
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Handbook on semidefinite, conic and polynomial optimization
- Extending the QCR method to general mixed-integer programs
- Title not available (Why is that?)
- Surrogate Constraints
- Optimizing nuclear power plant refueling with mixed-integer programming
- A semidefinite programming approach to the quadratic knapsack problem
- Stochastic nuclear outages semidefinite relaxations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Moments and sums of squares for polynomial optimization and related problems
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Semidefinite programming relaxation for nonconvex quadratic programs
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Partial Lagrangian relaxation for general quadratic programming
- 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
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- Title not available (Why is that?)
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Cited In (11)
- A unifying framework for several cutting plane methods for semidefinite programming
- Title not available (Why is that?)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- A new algorithm for concave quadratic programming
- Solving Quadratic Programming by Cutting Planes
- Title not available (Why is that?)
- A relaxed cutting plane method for semi-infinite semi-definite programming
- On linear programming relaxations for solving polynomial programming problems
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
- Title not available (Why is that?)
This page was built for publication: Generating cutting planes for the semidefinite relaxation of quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337405)
