The following pages link to (Q4996611):
Displaying 10 items.
- A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints (Q473861) (← links)
- Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming (Q683728) (← links)
- A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints (Q697548) (← links)
- A parametric linearizing approach for quadratically inequality constrained quadratic programs (Q1644881) (← links)
- An effective algorithm for globally solving quadratic programs using parametric linearization technique (Q1738251) (← links)
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950) (← links)
- A branch and bound algorithm for quantified quadratic programming (Q2397427) (← links)
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs (Q2409582) (← links)
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
- (Q4980087) (← links)
