Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems (Q3156718): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/10556780410001647203 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2017952273 / rank | |||
Normal rank | |||
Revision as of 02:31, 20 March 2024
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
