A multidimensional branch-and-prune method for interval global optimization

DOI10.1023/B:NUMA.0000049490.96077.99MaRDI QIDQ2387786zbMATH OpenOpenAlexFDO

Authors Tamás Vinkó, Dietmar Ratz

Publication date 5 September 2005

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:numa.0000049490.96077.99

zbMATH Keywords

global optimizationinclusion functioninterval methodskitepruning

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Optimal multisections in interval branch-and-bound methods of global optimization
• A new inclusion function for optimization: kite -- the one-dimensional case
• A branch-and-prune method for global optimization
• scientific article; zbMATH DE number 1543292
• Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results

Cited in

(5)

• Optimal multisections in interval branch-and-bound methods of global optimization
• Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm
• A new inclusion function for optimization: kite -- the one-dimensional case
• Optimal circle covering problems and their applications
• A second-order pruning step for verified global optimization

Describes a project that uses

Uses Software

• INTOPT_90

This page was built for publication: A multidimensional branch-and-prune method for interval global optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2387786)