Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems (Q3156718)
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: Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems |
scientific article |
Statements
Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems (English)
0 references
11 January 2005
0 references
quadratic \(\{-1
0 references
1\}\) progamming
0 references
low rank factorization
0 references
feasible direction algorithm
0 references
semidefinite programming
0 references
convergence
0 references
numerical examples
0 references
max-cut problem
0 references
0 references
0 references
0 references
