An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:48, 5 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
