| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
The Spherical Constraint in Boolean Quadratic Programs
Abstract : We propose a new approach to bound Boolean quadratic optimization problems. The idea is to re-express Boolean constraints as one ''spherical'' constraint. Dualizing this constraint then amounts to a semidefinite least-squares problem which can be efficiently solved. Studying this dualization also provides an alternative interpretation of the relaxation and reveals a new class of non-convex problems with no duality gap.
Cited literature [33 references]
https://hal.inria.fr/inria-00070518
Contributor : Jérôme Malick <>
Submitted on : Monday, March 25, 2013 - 2:27:01 PM
Last modification on : Tuesday, February 9, 2021 - 3:20:06 PM
Long-term archiving on: : Wednesday, June 26, 2013 - 4:01:26 AM
Contributor : Jérôme Malick <>
Submitted on : Monday, March 25, 2013 - 2:27:01 PM
Last modification on : Tuesday, February 9, 2021 - 3:20:06 PM
Long-term archiving on: : Wednesday, June 26, 2013 - 4:01:26 AM
File
07-malick.pdf
Files produced by the author(s)