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

Claudia D'Ambrosio*, Jon Lee, Andreas Wächter

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

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 (US)
Title of host publicationAlgorithms - ESA 2009 - 17th Annual European Symposium, Proceedings
Pages107-118
Number of pages12
DOIs
StatePublished - Nov 2 2009
Event17th Annual European Symposium on Algorithms, ESA 2009 - Copenhagen, Denmark
Duration: Sep 7 2009Sep 9 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

Other

Other17th Annual European Symposium on Algorithms, ESA 2009
CountryDenmark
CityCopenhagen
Period9/7/099/9/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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