How to guarantee finite termination of verifying global optimization codes

From MaRDI portal

Publication:1300086

Jump to:navigation, search

DOI10.1023/A:1026493608620zbMath0931.65061OpenAlexW110383393MaRDI QIDQ1300086

Gerhard Heindl

Publication date: 14 February 2000

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1026493608620

zbMATH Keywords

algorithms global optimization convergence interval analysis finite termination controlling rounding errors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)

This page was built for publication: How to guarantee finite termination of verifying global optimization codes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1300086&oldid=13408169"