Treffer: An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem.
Title:
An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem.
Authors:
Grippo, Luigi1 grippo@dis.uniroma1.it, Palagi, Laura1 palagi@dis.uniroma1.it, Piccialli, Veronica2 piccialli@disp.uniroma2.it
Source:
Mathematical Programming. Jan2011, Vol. 126 Issue 1, p119-146. 28p. 2 Charts, 2 Graphs.
Database:
Business Source Ultimate