Pages that link to "Item:Q4629340"
From MaRDI portal
The following pages link to Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection (Q4629340):
Displaying 9 items.
- Globally solving extended trust region subproblems with two intersecting cuts (Q2228371) (← links)
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
- An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection (Q4997173) (← links)
- A note on the SDP relaxation of the minimum cut problem (Q6064052) (← links)
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis (Q6064054) (← links)
- An entropy-regularized ADMM for binary quadratic programming (Q6085714) (← links)
- New semidefinite relaxations for a class of complex quadratic programming problems (Q6166105) (← links)
- IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming (Q6498407) (← links)
- Semidefinite programming approximation for a matrix optimization problem over an uncertain linear system (Q6668153) (← links)
