Two acceleration mechanisms in verified global optimization

DOI10.1016/j.cam.2005.08.032zbMath1108.65069OpenAlexW2049861637MaRDI QIDQ861910

H. Tapamo, Andreas Frommer

Publication date: 2 February 2007

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2005.08.032

zbMATH Keywords

algorithmsglobal optimizationnumerical examplesparallel computinginterval arithmeticinterval Newton method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30) Parallel numerical computation (65Y05) Algorithms with automatic result verification (65G20)

Uses Software

• INTOPT_90

Cites Work

• Rigorous global search: continuous problems
• Numerical experiences with a new generalized subinterval selection criterion for interval global optimization
• Parallel methods for verified global optimization practice and theory
• A new parallel method for verified global optimization
• A Branch-and-Prune Method for Global Optimization
• New subinterval selection criteria for interval global optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two acceleration mechanisms in verified global optimization