Binary quadratic optimization problems that are difficult to solve by conic relaxations
Authors:
- Sunyoung KimSKSunyoung Kim
- Masakazu KojimaMKMasakazu Kojima
- 1 May 2017
- journal article
- Published by Elsevier in Discrete Optimization
- Vol. 24, 170-183
Abstract
No abstract availableFunding Information
- NRF (2012-R1A1A2-038982, 2014-R1A2A1A11049618)
- Grant-in-Aid for Scientific Research (26242027)
- Japan Science and Technology Agency
- Core Research of Evolutionary Science and Technology
This publication has 10 references indexed in Scilit:
- Sparse sum-of-squares certificates on finite abelian groups2016
- A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problemsMathematical Programming, 2015
- Algorithm 883ACM Transactions on Mathematical Software, 2008
- On the copositive representation of binary and continuous nonconvex quadratic programsMathematical Programming, 2008
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured SparsitySIAM Journal on Optimization, 2006
- Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut PolytopeMathematics of Operations Research, 2003
- GloptiPolyACM Transactions on Mathematical Software, 2003
- Global Optimization with Polynomials and the Problem of MomentsSIAM Journal on Optimization, 2001
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric conesOptimization Methods and Software, 1999
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995