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...
Uloženo v:
| Hlavní autoři: | , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Elsevier
2017-09-01
|
| Edice: | EURO Journal on Computational Optimization |
| Témata: | |
| On-line přístup: | http://www.sciencedirect.com/science/article/pii/S2192440621000836 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|