## Abstract

Every quadratic programming problem with a mix of continuous and binary variables can be equivalently reformulated as a completely positive optimization problem, that is, a linear optimization problem over the convex but computationally intractable cone of completely positive matrices. In this paper, we focus on general inner approximations of the cone of completely positive matrices on instances of completely positive optimization problems that arise from the reformulation of mixed binary quadratic programming problems. We provide a characterization of the feasibility of such an inner approximation as well as the optimal value of a feasible inner approximation. In particular, our results imply that polyhedral inner approximations are equivalent to a finite discretization of the feasible region of the original completely positive optimization problem. Our characterization yields, as a byproduct, an upper bound on the gap between the optimal value of an inner approximation and that of the original instance. We discuss the implications of this error bound for standard and box-constrained quadratic programs as well as general mixed binary quadratic programs with a bounded feasible region.

Original language | English |
---|---|

Pages (from-to) | 1163-1186 |

Number of pages | 24 |

Journal | Optimization Methods and Software |

Volume | 32 |

Issue number | 6 |

DOIs | |

Publication status | Published - 2 Nov 2017 |

## Keywords

- completely positive cone
- inner approximation
- mixed binary quadratic programming problems
- polyhedral approximations