On stopping criteria in verified nonlinear systems or optimization algorithms

DOI10.1145/358407.358418zbMath1365.65139OpenAlexW2013707664WikidataQ113309816 ScholiaQ113309816MaRDI QIDQ4406299

G. William Walster, Ralph Baker Kearfott

Publication date: 25 June 2003

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/358407.358418

zbMATH Keywords

performanceverificationalgorithmsreliability

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Algorithms with automatic result verification (65G20)

Related Items (2)

Motivations for an arbitrary precision interval arithmetic and the MPFI library ⋮ Control analysis and design via randomised coordinate polynomial minimisation

This page was built for publication: On stopping criteria in verified nonlinear systems or optimization algorithms