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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Marcia Fampa, Jon Lee, Wendel Melo
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!