On global optimization with indefinite quadratics
We present an algorithmic framework for global optimization problems in which the non-convexity is manifested as an indefinite-quadratic as part of the objective function. Our solution approach consists of applying a spatial branch-and-bound algorithm, exploiting convexity as much as possible, not o...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Elsevier
2017
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/32e24a8df238414eb7b2fde88fb79020 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | We present an algorithmic framework for global optimization problems in which the non-convexity is manifested as an indefinite-quadratic as part of the objective function. Our solution approach consists of applying a spatial branch-and-bound algorithm, exploiting convexity as much as possible, not only convexity in the constraints, but also extracted from the indefinite-quadratic. A preprocessing stage is proposed to split the indefinite-quadratic into a difference of convex quadratic functions, leading to a more efficient spatial branch-and-bound focused on the isolated non-convexity. We investigate several natural possibilities for splitting an indefinite quadratic at the preprocessing stage, and prove the equivalence of some of them. Through computational experiments with our new solver iquad, we analyze how the splitting strategies affect the performance of our algorithm, and find guidelines for choosing amongst them. |
|---|