A Formally Verified Generic Branching Algorithm for Global Optimization

@inproceedings{Narkawicz2013AFV,
  title={A Formally Verified Generic Branching Algorithm for Global Optimization},
  author={Anthony Narkawicz and C{\'e}sar A. Mu{\~n}oz},
  booktitle={VSTTE},
  year={2013}
}
This paper presents a formalization in higher-order logic of a generic algorithm that is used in automated strategies for solving global optimization problems. It is a generalization of numerical branch and bound algorithms that compute the minimum of a function on a given domain by recursively dividing the domain and computing estimates for the range of the function on each sub-domain. The correctness statement of the algorithm has been proved in the Prototype Verification System (PVS) theorem… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS