Pages that link to "Item:Q902837"
From MaRDI portal
The following pages link to A new bound-and-reduce approach of nonconvex quadratic programming problems (Q902837):
Displaying 7 items.
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961) (← links)
- A reduced proximal-point homotopy method for large-scale non-convex BQP (Q2114822) (← links)
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs (Q2409582) (← links)
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems (Q2572774) (← links)
- Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
- A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem (Q6617001) (← links)