.png){kind=icon}
.png){kind=icon}
Return
A branch-and-bound algorithm with growing datasets for large-scale estimation
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2024.02.020.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The solution of nonconvex parameter estimation problems with deterministic global optimization methods is desirable but challenging, especially if large measurement datasets are considered. We propose to exploit the structure of this class of optimization problems to enable their solution with the spatial branch -and -bound algorithm. In detail, we start with a reduced dataset in the root node and progressively augment it, converging to the full dataset. We show for nonlinear programs (NLPs) that our algorithm converges to the global solution of the original problem considering the full dataset. The implementation of the algorithm extends our opensource solver MAiNGO. A numerical case study with a mixed -integer nonlinear program (MINLP) from chemical engineering and a dynamic optimization problem from biochemistry both using noise -free measurement data emphasizes the potential for savings of computational effort with our proposed approach.
Keywords:
Global optimization
Nonlinear programming
Large scale optimization
Regression
Spatial branch and bound algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
View more organizations