Pages that link to "Item:Q453058"
From MaRDI portal
The following pages link to A new semidefinite programming relaxation scheme for a class of quadratic matrix problems (Q453058):
Displaying 9 items.
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems (Q1777422) (← links)
- On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Efficient first-order methods for convex minimization: a constructive approach (Q2205976) (← links)
- A new semidefinite relaxation for \(L_{1}\)-constrained quadratic (Q2353474) (← links)
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
- On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming (Q3169131) (← links)
- On Convex Hulls of Epigraphs of QCQPs (Q5041762) (← links)
- Accelerated first-order methods for a class of semidefinite programs (Q6665390) (← links)