Convex programming approaches for polynomial MINLP

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

Abstract

The aim of this workshop was fostering the growth of new mathematical ideas arising from mixed-integer nonlinear optimization. In this regard, the workshop has been a resounding success. It has covered a very diverse scientific landscape, including automated proof in computational geometry, the analysis of computational complexity of MINO in fixed and variable dimension, the solution of infinite MINO such as those appearing in mixed integer optimal control, the theoretical and computational deployment of traditional integer and continuous approaches to achieve new solution algorithms for large-scale MINO, a classification of the most interesting engineering and technology applications of MINO, and more. It has synthesized twenty open questions and challenges which will serve as a roadmap for the years to come.
Original languageEnglish
Title of host publicationMathematisches Forschungsinstitut Oberwolfach Report No. 46/2015
Pages2716-2718
Number of pages3
DOIs
Publication statusPublished - 2015

Publication series

NameMathematisches Forschungsinstitut Oberwolfach Report

Fingerprint Dive into the research topics of 'Convex programming approaches for polynomial MINLP'. Together they form a unique fingerprint.

  • Cite this

    de Klerk, E. (2015). Convex programming approaches for polynomial MINLP. In Mathematisches Forschungsinstitut Oberwolfach Report No. 46/2015 (pp. 2716-2718). (Mathematisches Forschungsinstitut Oberwolfach Report). https://doi.org/10.4171/OWR/2015/46