Towards global parameter estimation exploiting reduced data sets

DOI10.1080/10556788.2023.2205645OpenAlexW4382292673MaRDI QIDQ6065211

Unnamed Author, Jaromił Najman, Susanne Sass, Alexander Mitsos, Dominik Bongartz, Angelos Tsoukalas

Publication date: 11 December 2023

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2023.2205645

zbMATH Keywords

parameter estimationdeterministic global optimizationMINLPEOSB\&B algorithm

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Exploring or reducing noise? A global optimization algorithm in the presence of noise
• Towards global bilevel dynamic optimization
• On the limited memory BFGS method for large scale optimization
• Handbook of global optimization
• Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
• A polyhedral branch-and-cut approach to global optimization
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• Deterministic global optimization. Theory, methods and applications
• Multivariate McCormick relaxations
• Global optimization with nonlinear ordinary differential equations
• McCormick-Based Relaxations of Algorithms
• Updating Quasi-Newton Matrices with Limited Storage
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems