Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches

DOI10.1007/s10287-018-0337-6OpenAlexW2903170383MaRDI QIDQ2010370

Jianqiang Cheng, Jia Liu, Immanuel M. Bomze, Abdel Lisser, Peter J. C. Dickinson

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

zbMATH Keywords

nonlinear optimizationnonconvex optimizationquadratic optimizationquadratic assignment problemcompletely positivecopositivitypenalization methodreformulationsmul tidimensional knapsack problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20) Operations research and management science (90Bxx)

Related Items

Distributionally Robust Chance Constrained Geometric Optimization

Uses Software

• QAPLIB
• SeDuMi
• OR-Library
• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
• On the computational complexity of membership problems for the completely positive cone and its dual
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs
• QAPLIB - a quadratic assignment problem library
• A fresh CP look at mixed-binary QPs: new formulations and relaxations
• A gentle, geometric introduction to copositive optimization
• On the copositive representation of binary and continuous nonconvex quadratic programs
• New results on the cp-rank and related properties of co(mpletely )positive matrices
• An aggregate subgradient method for nonsmooth convex minimization
• Graph Implementations for Nonsmooth Convex Programs
• An improved characterisation of the interior of the completely positive cone
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• New Lower Bounds and Asymptotics for the cp-Rank
• Some NP-complete problems in quadratic and nonlinear programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• On copositive programming and standard quadratic optimization problems