Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches
DOI10.1007/S10287-018-0337-6OpenAlexW2903170383MaRDI QIDQ2010370FDOQ2010370
Authors: Immanuel M. Bomze, Jianqiang Cheng, Peter J. C. Dickinson, Abdel Lisser, Jia Liu 
Publication date: 27 November 2019
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-018-0337-6
Recommendations
- A fresh CP look at mixed-binary QPs: new formulations and relaxations
- Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis
- Reformulation of the quadratic multidimensional knapsack problem as copositive/completely positive programs
- A simplified completely positive reformulation for binary quadratic programs
- A note on Burer's copositive representation of mixed-binary QPs
nonconvex optimizationquadratic assignment problemnonlinear optimizationquadratic optimizationpenalization methodcompletely positivereformulationscopositivitymul tidimensional knapsack problem
Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Operations research and management science (90Bxx)
Cites Work
- QAPLIB - a quadratic assignment problem library
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Some NP-complete problems in quadratic and nonlinear programming
- An aggregate subgradient method for nonsmooth convex minimization
- Graph implementations for nonsmooth convex programs
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- On the computational complexity of membership problems for the completely positive cone and its dual
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Title not available (Why is that?)
- A gentle, geometric introduction to copositive optimization
- On copositive programming and standard quadratic optimization problems
- New results on the cp-rank and related properties of co(mpletely) positive matrices
- New lower bounds and asymptotics for the cp-rank
- An improved characterisation of the interior of the completely positive cone
- A fresh CP look at mixed-binary QPs: new formulations and relaxations
Cited In (1)
Uses Software
This page was built for publication: Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010370)
