Interval Methods for Global Optimization Using the Boxing Method

DOI10.1007/978-1-4757-6484-0_17zbMath1391.65126OpenAlexW149032398MaRDI QIDQ4577116

Rudi Klatte, Andreas Wiethoff, Dietmar Ratz, András Erik Csallner

Publication date: 16 July 2018

Published in: Scientific Computing, Validated Numerics, Interval Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4757-6484-0_17

zbMATH Keywords

global optimizationinterval Newton methodinterval subdivision methodaccelerating deviceboxing method

Mathematics Subject Classification ID

Nonlinear programming (90C30) General methods in interval analysis (65G40)

Uses Software

• C-XSC
• C-XSC 2.0
• INTOPT_90
• minpack
• PASCAL-XSC

Cites Work

• Rigorous global search: continuous problems
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization
• Interval Methods for Systems of Equations
• Subdivision Direction Selection in Interval Methods for Global Optimization
• Global optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Interval Methods for Global Optimization Using the Boxing Method