Pages that link to "Item:Q2713937"
From MaRDI portal
The following pages link to Branch-and-bound method for the minimization problem for a nonconvex quadratic function under convex quadratic constraints (Q2713937):
Displaying 6 items.
- Quadratic problems defined on a convex hull of points (Q1102708) (← links)
- An algorithm for indefinite quadratic programming with convex constraints (Q1180839) (← links)
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems (Q1273054) (← links)
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints (Q1575066) (← links)
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints (Q1679484) (← links)
- An Ellipsoidal Branch and Bound Algorithm for Global Optimization (Q3563904) (← links)