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

Mixed Integer Nonlinear Programming
Convex Programming
Polynomial
Integer
Computational Geometry
Nonlinear Optimization
Optimal Control
Computational Complexity
Engineering

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
de Klerk, Etienne. / Convex programming approaches for polynomial MINLP. Mathematisches Forschungsinstitut Oberwolfach Report No. 46/2015. 2015. pp. 2716-2718 (Mathematisches Forschungsinstitut Oberwolfach Report).
@inproceedings{6e08b0b4e65a4104ada08b4c2cddacfa,
title = "Convex programming approaches for polynomial MINLP",
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.",
author = "{de Klerk}, Etienne",
year = "2015",
doi = "10.4171/OWR/2015/46",
language = "English",
series = "Mathematisches Forschungsinstitut Oberwolfach Report",
pages = "2716--2718",
booktitle = "Mathematisches Forschungsinstitut Oberwolfach Report No. 46/2015",

}

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

Convex programming approaches for polynomial MINLP. / de Klerk, Etienne.

Mathematisches Forschungsinstitut Oberwolfach Report No. 46/2015. 2015. p. 2716-2718 (Mathematisches Forschungsinstitut Oberwolfach Report).

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

TY - GEN

T1 - Convex programming approaches for polynomial MINLP

AU - de Klerk, Etienne

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

U2 - 10.4171/OWR/2015/46

DO - 10.4171/OWR/2015/46

M3 - Conference contribution

T3 - Mathematisches Forschungsinstitut Oberwolfach Report

SP - 2716

EP - 2718

BT - Mathematisches Forschungsinstitut Oberwolfach Report No. 46/2015

ER -

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