Pages that link to "Item:Q1304344"
From MaRDI portal
The following pages link to A new semidefinite programming bound for indefinite quadratic forms over a simplex (Q1304344):
Displaying 10 items.
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (Q940828) (← links)
- A clique algorithm for standard quadratic programming (Q955308) (← links)
- A study on sequential minimal optimization methods for standard quadratic problems (Q2095525) (← links)
- On monotonicity and search strategies in face-based copositivity detection algorithms (Q2155140) (← links)
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320) (← links)
- A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) (← links)
- Duality bound method for the general quadratic programming problem with quadratic constraints (Q5925726) (← links)