Pages that link to "Item:Q717135"
From MaRDI portal
The following pages link to Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135):
Displaying 13 items.
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms (Q5110560) (← links)
- Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs (Q5148407) (← links)
- Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction (Q5348475) (← links)
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs (Q5746688) (← links)
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems (Q6102175) (← links)
- Literature reviews in operations research: a new taxonomy and a meta review (Q6106580) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
- Sustainable two stage supply chain management: a quadratic optimization approach with a quadratic constraint (Q6170034) (← links)
- A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints (Q6534829) (← links)
- A disjunctive cutting plane algorithm for bilinear programming (Q6622752) (← links)
- Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations (Q6665387) (← links)
