A global-optimization algorithm for mixed-integer nonlinear programs having separable non-convexity

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a global optimization algorithm for MINLPs (mixed-integer nonlinear programs) where any non-convexity is manifested as sums of non-convex univariate functions. The algorithm is implemented at the level of a modeling language, and we have had substantial success in our preliminary computational experiments.

Original languageEnglish
Title of host publicationAlgorithms - ESA 2009 - 17th Annual European Symposium, Proceedings
Pages107-118
Number of pages12
DOIs
Publication statusPublished - 2 Nov 2009
Externally publishedYes
Event17th Annual European Symposium on Algorithms, ESA 2009 - Copenhagen, Denmark
Duration: 7 Sept 20099 Sept 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5757 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th Annual European Symposium on Algorithms, ESA 2009
Country/TerritoryDenmark
CityCopenhagen
Period7/09/099/09/09

Fingerprint

Dive into the research topics of 'A global-optimization algorithm for mixed-integer nonlinear programs having separable non-convexity'. Together they form a unique fingerprint.

Cite this