Pages that link to "Item:Q3491318"
From MaRDI portal
The following pages link to Guaranteed \(\epsilon\)-approximate solution for indefinite quadratic global minimization (Q3491318):
Displaying 12 items.
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
- Global minimization of indefinite quadratic problems (Q1092620) (← links)
- Global optimization of fractional programs (Q1186270) (← links)
- Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
- Parallel computing in nonconvex programming (Q1309859) (← links)
- A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961) (← links)
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (Q2786313) (← links)
- Global minimization of indefinite quadratic functions subject to box constraints (Q4697332) (← links)