An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDPA / rank | |||
Normal rank | |||
Revision as of 16:37, 29 February 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
