Pages that link to "Item:Q623464"
From MaRDI portal
The following pages link to An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464):
Displayed 5 items.
- DSDP5 (Q16587) (← links)
- A feasible method for optimization with orthogonality constraints (Q101635) (← links)
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems (Q839323) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)