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): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDP_S / rank | |||
Normal rank | |||
Revision as of 17:39, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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 |
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
