A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
Year of publication: |
2024
|
---|---|
Authors: | Sass, Susanne ; Mitsos, Alexander ; Bongartz, Dominik ; Bell, Ian H. ; Nikolov, Nikolai ; Tsoukalas, Angelos |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 316.2024, 1 (1.7.), p. 36-45
|
Subject: | Global optimization | Large scale optimization | Nonlinear programming | Regression | Spatial branch and bound algorithm | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm | Schätztheorie | Estimation theory | Regressionsanalyse | Regression analysis |
-
SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression
Flores, Salvador, (2015)
-
Preciado Arreola, José Luis, (2020)
-
Particle swarm optimization : an alternative for parameter estimation in regression
Cobos Silva, Sergio Gerardo de los, (2013)
- More ...
-
Global dynamic optimization with Hammerstein–Wiener models embedded
Kappatou, Chrysoula D., (2022)
-
Linearization of McCormick relaxations and hybridization with the auxiliary variable method
Najman, Jaromił, (2021)
-
Global optimization of generalized semi-infinite programs via restriction of the right hand side
Mitsos, Alexander, (2015)
- More ...