A robust algorithm for quadratic optimization under quadratic constraints
- 163 Downloads
Most existing methods of quadratically constrained quadratic optimization actually solve a refined linear or convex relaxation of the original problem. It turned out, however, that such an approach may sometimes provide an infeasible solution which cannot be accepted as an approximate optimal solution in any reasonable sense. To overcome these limitations a new approach is proposed that guarantees a more appropriate approximate optimal solution which is also stable under small perturbations of the constraints.
KeywordsNonconvex global optimization Quadratic optimization under quadratic constraints Branch-reduce-and-bound successive incumbent transcending algorithm Essential optimal solution Robust solution
Unable to display preview. Download preview PDF.
- 2.Audet C., Hansen P., Jaumard B., Savard G. (2000): A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Math. Program. Ser. A 87, 131–152Google Scholar
- 4.Floudas C.A. (1999): Deterministic Global Optimization. Kluwer, DordrechtGoogle Scholar
- 5.Floudas C.A. et al. (1999): Handbook of Test Problems in Local and Global Optimization. Kluwer, DordrechtGoogle Scholar
- 6.Horst R., Tuy H. (1996): Global Optimization: Deterministic Approaches, 3rd edn. Springer, BerlinGoogle Scholar
- 11.Shor N.Z., Stetsenko S.I. (1989): Quadratic Extremal Problems and Nondifferentiable Optimization. Naukova Dumka, Kiev in RussianGoogle Scholar
- 12.Shor N.Z. (1998): Nondifferentiable Optimization and Polynomial Problems. Kluwer, DordrechtGoogle Scholar
- 13.Tuy H. (1998): Convex Analysis and Global Optimization. Kluwer, DordrechtGoogle Scholar
- 17.Tuy H. (2005): Polynomial optimization: a robust approach. Pac. J. Optim. 1, 357–374Google Scholar