Hull-Volume with Applications to Convergence Analysis
- 144 Downloads
We introduce and study decompositions of finite sets as well as coverings of their convex hulls, and use these objects to develop various estimates of and formulas for the “hull-volume” of the sets (i.e., the volume of their convex hull). We apply our results to the convergence analysis of the “iterate-sets” associated with each iteration of a reduce-or-retreat optimization method (including pattern-search methods like Nelder–Mead as well as model-based methods).
KeywordsPolytope Convex hull Simplex Volume Numerical optimization Convergence analysis
Unable to display preview. Download preview PDF.
- 1.Levy, A.B.: Descent and convergence in reduce-or-retreat optimization methods. Preprint (2011) Google Scholar
- 9.Lee, C.W.: Regular Triangulations of Convex Polytopes. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 4, pp. 443–456. Am. Math. Soc., Providence (1991) Google Scholar