The Spherical Constraint in Boolean Quadratic Programs - BIPOP Accéder directement au contenu
Rapport Année : 2005

The Spherical Constraint in Boolean Quadratic Programs

Résumé

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.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-5489.pdf (251.17 Ko) Télécharger le fichier

Dates et versions

inria-00070518 , version 1 (19-05-2006)
inria-00070518 , version 2 (25-03-2013)

Identifiants

  • HAL Id : inria-00070518 , version 1

Citer

Jérôme Malick. The Spherical Constraint in Boolean Quadratic Programs. RR-5489, 2005, pp.13. ⟨inria-00070518v1⟩

Collections

INRIA-RRRT
192 Consultations
773 Téléchargements

Partager

Gmail Facebook X LinkedIn More