Pages that link to "Item:Q1848385"
From MaRDI portal
The following pages link to On the finite convergence of successive SDP relaxation methods (Q1848385):
Displaying 4 items.
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- Error bounds and finite termination for constrained optimization problems (Q1717787) (← links)
- Generalized S-lemma and strong duality in nonconvex quadratic programming (Q2392110) (← links)
- Complexity analysis of successive convex relaxation methods for nonconvex sets. (Q2757680) (← links)