A Branch-and-Prune Method for Global Optimization

DOI10.1007/978-1-4757-6484-0_18zbMath1391.90644OpenAlexW43577856MaRDI QIDQ4577117

T. N. Grapsa, D. G. Sotiropoulos

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_18

zbMATH Keywords

global optimizationinterval arithmeticbranch and pruneoptimal center

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items (3)

A second-order pruning step for verified global optimization ⋮ Two acceleration mechanisms in verified global optimization ⋮ A new inclusion function for optimization: kite -- the one-dimensional case

Uses Software

• C-XSC
• INTOPT_90

Cites Work

• Optimal centered forms
• Mean value forms in interval analysis
• Global optimization using interval analysis - the multi-dimensional case
• A nonsmooth global optimization technique using slopes: The one-dimensional case
• Rigorous global search: continuous problems
• Interval Methods for Systems of Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Branch-and-Prune Method for Global Optimization