An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464): 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.1007/s10107-009-0275-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000661792 / rank | |||
Normal rank | |||
Revision as of 20:25, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem |
scientific article |
Statements
An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (English)
0 references
14 February 2011
0 references
semidefinite programming
0 references
low-rank factorization
0 references
maxcut problem
0 references
nonlinear programming
0 references
exact penalty functions
0 references
