A generic interval branch and bound algorithm for parameter estimation
From MaRDI portal
Publication:2416576
DOI10.1007/s10898-018-0721-3zbMath1420.90050OpenAlexW2529716682WikidataQ128879667 ScholiaQ128879667MaRDI QIDQ2416576
Pascal Monasse, Gilles Trombettoni, Martin de la Gorce, Bertrand Neveu
Publication date: 23 May 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://hal-enpc.archives-ouvertes.fr/hal-01942306/file/bbestim_jogo_2018.pdf
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Upper bounding in inner regions for global optimization under inequality constraints
- A reliable affine relaxation method for global optimization
- Contractor programming
- Adaptive constructive interval disjunction: algorithms and experiments
- A polyhedral branch-and-cut approach to global optimization
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Guaranteed robust nonlinear minimax estimation
- Node selection strategies in interval branch and bound algorithms
This page was built for publication: A generic interval branch and bound algorithm for parameter estimation