Pages that link to "Item:Q839323"
From MaRDI portal
The following pages link to Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems (Q839323):
Displaying 4 items.
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
- A strengthened Barvinok-Pataki bound on SDP rank (Q2670438) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
