Pages that link to "Item:Q1579950"
From MaRDI portal
The following pages link to An algorithm for global minimization of linearly constrained quadratic functions (Q1579950):
Displaying 11 items.
- A canonical dual approach for solving linearly constrained quadratic programs (Q439448) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← links)
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation (Q879567) (← links)
- A new bound-and-reduce approach of nonconvex quadratic programming problems (Q902837) (← links)
- A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints (Q945281) (← links)
- A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints (Q2425955) (← links)
- Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis. (Q2477109) (← links)
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems (Q2572774) (← links)
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (Q2786313) (← links)
