Pages that link to "Item:Q1749779"
From MaRDI portal
The following pages link to A semidefinite programming method for integer convex quadratic minimization (Q1749779):
Displaying 5 items.
- On the Burer-Monteiro method for general semidefinite programs (Q2047215) (← links)
- SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
- Approximation Bounds for Sparse Programs (Q5073726) (← links)
- Learning Optimized Risk Scores (Q5214243) (← links)
- Integrability and complexity in quantum spin chains (Q6600308) (← links)
