A new interval method for locating the boundary of level sets
From MaRDI portal
Publication:4291046
DOI10.1080/00207169308804215zbMath0807.65067OpenAlexW2095202583WikidataQ126246103 ScholiaQ126246103MaRDI QIDQ4291046
János D. Pintér, Tibor Csendes
Publication date: 28 February 1995
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169308804215
algorithmconvergencenumerical exampleparameter estimationsensitivity analysisinterval arithmeticlevel setsinterval methodinclusion functionbisectionnonlinear minimizationMoore-Skelboe method
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Interval method for bounding level sets: Revisited and tested with global optimization problems
- Globally optimized calibration of environmental models
- An interval method for bounding level sets of parameter estimation problems
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
- Inclusion functions and global optimization
- Efficiency of a Global Optimization Algorithm