On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods |
scientific article; zbMATH DE number 6197835
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods |
scientific article; zbMATH DE number 6197835 |
Statements
On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (English)
0 references
12 August 2013
0 references
The authors consider semidefinite reformulations of 0-1 quadratic problems (with linear or quadratic constraints) as well as semi-definite bounds obtained by Lagrangian duality. The main result of this paper is the study of such semi-definite bounds including conclusions for solution methods. Finally, computational results and a corresponding discussion is presented.
0 references
Lagrangian duality
0 references
combinatorial optimization
0 references
0-1 quadratic programming
0 references
nonlinear programming
0 references
semidefinite programming
0 references
quasi-Newton
0 references
0 references
0 references
0 references
0 references
0 references
0.7938347458839417
0 references
0.7875169515609741
0 references
0.7806088924407959
0 references
0.7802589535713196
0 references
