Convex mixed integer nonlinear programming problems and an outer approximation algorithm

In this paper, we mainly study one class of convex mixed-integer nonlinear programming problems (MINLPs) with non-differentiable data. By dropping the differentiability assumption, we substitute gradients with subgradients obtained from KKT conditions, and use the outer approximation method to refor...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Zhou, Wei, Ali, M Montaz
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 23.02.2015
Predmet:	Algorithms Approximation Mathematical analysis Mixed integer Nonlinear programming
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!