A fresh CP look at mixed-binary QPs: new formulations and relaxations
type: Item
instance of: scholarly article
title: A fresh CP look at mixed-binary QPs: new formulations and relaxations
zbMATH Open document ID: 1386.90097
author: Jianqiang Cheng
author: Peter J. C. Dickinson
author: Abdel Lisser
author: Immanuel M. Bomze
published in: Mathematical Programming. Series A. Series B
publication date: 2017-12-01T00:00:00Z
full work available at URL: http://hdl.handle.net/10150/632069
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6814726
zbMATH Keywords: copositivity
zbMATH Keywords: completely positive
zbMATH Keywords: conic optimization
zbMATH Keywords: quadratic optimization
zbMATH Keywords: reformulations
zbMATH Keywords: nonlinear optimization
zbMATH Keywords: nonconvex optimization
MaRDI profile type: Publication
OpenAlex ID: W2575524387
cites work: Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables
cites work: Cones, matrices and mathematical programming
cites work: Q4405832
cites work: Copositive optimization -- recent developments and applications
cites work: Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
cites work: On copositive programming and standard quadratic optimization problems
cites work: A note on Burer's copositive representation of mixed-binary QPs
cites work: New Lower Bounds and Asymptotics for the cp-Rank
cites work: Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
cites work: On the copositive representation of binary and continuous nonconvex quadratic programs
cites work: Optimizing a polyhedral-semidefinite relaxation of completely positive programs
cites work: Copositive Programming
cites work: A gentle, geometric introduction to copositive optimization
cites work: On the computational complexity of membership problems for the completely positive cone and its dual
cites work: Computing a Sparse Basis for the Null Space
cites work: Some NP-complete problems in quadratic and nonlinear programming
cites work: Q4517098
cites work: On the Closedness of the Linear Image of a Closed Convex Cone
cites work: New results on the cp-rank and related properties of co(mpletely )positive matrices
cites work: Q3802887
cites work: Q4337625
DOI: 10.1007/S10107-017-1109-8
description: scientific article; zbMATH DE number 6814726