On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0-1 quadratic problems leading to quasi-Newton methods - Archive ouverte HAL Access content directly
Journal Articles Mathematical Programming Year : 2013

On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0-1 quadratic problems leading to quasi-Newton methods

Abstract

This article presents a family of semidefinite programming bounds, obtained by Lagrangian duality, for 0-1 quadratic optimization problems with linear or quadratic constraints. These bounds have useful computational properties: they have a good ratio of tightness to computing time, they can be optimized by a quasi-Newton method, and their final tightness level is controlled by a real parameter. These properties are illustrated on three standard combinatorial optimization problems: unconstrained 0-1 quadratic optimization, heaviest k-subgraph, and graph bisection.
Fichier principal
Vignette du fichier
malick-roupin-2011.pdf (178.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00662367 , version 1 (23-01-2012)

Identifiers

Cite

Jérôme Malick, Frédéric Roupin. On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0-1 quadratic problems leading to quasi-Newton methods. Mathematical Programming, 2013, 140 (1), pp.99-124. ⟨10.1007/s10107-012-0628-6⟩. ⟨hal-00662367⟩
589 View
659 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More