Pages that link to "Item:Q933068"
From MaRDI portal
The following pages link to A successive quadratic programming algorithm for SDP relaxation of Max-Bisection (Q933068):
Displaying 3 items.
- Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems (Q3156718) (← links)
- A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF THE BINARY QUADRATIC PROGRAMMING (Q3369951) (← links)
- Exact SDP relaxations for quadratic programs with bipartite graph structures (Q6173960) (← links)