Pages that link to "Item:Q1180839"
From MaRDI portal
The following pages link to An algorithm for indefinite quadratic programming with convex constraints (Q1180839):
Displaying 8 items.
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
- An algorithm for solving convex programs with an additional convex- concave constraint (Q689151) (← links)
- Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← links)
- A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
- Method for minimizing a convex-concave function over a convex set (Q1176848) (← links)
- A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961) (← links)
- A new algorithm for solving the general quadratic programming problem (Q1908926) (← links)
- A global optimization algorithm using linear relaxation (Q2507847) (← links)
