Pages that link to "Item:Q1029700"
From MaRDI portal
The following pages link to Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700):
Displaying 3 items.
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints (Q6661703) (← links)
- Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations (Q6665387) (← links)
- Solving a class of two-stage stochastic nonlinear integer programs using value functions (Q6667707) (← links)