Pages that link to "Item:Q6173960"
From MaRDI portal
The following pages link to Exact SDP relaxations for quadratic programs with bipartite graph structures (Q6173960):
Displaying 7 items.
- Exactness criteria for SDP-relaxations of quadratic extremum problems (Q508574) (← links)
- Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs (Q517302) (← links)
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures (Q2114577) (← links)
- On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
- New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
- Further development in convex conic reformulation of geometric nonconvex conic optimization problems (Q6622748) (← links)