On geometry and convergence of a class of simplicial covers

References

• Benson , H.P. and Horst , R. 1991 . A Branch and Bound-Outer Approximation Algorithm for Concave Minimization over a Convex Set . J. Computers and Mathematics with Applications , 21 : 67 – 76 .
   Web of Science ®Google Scholar
• Horst , R. , Thoai , N.V. and Benson , H.P. 1991 . Concave Minimization via Conical Partitions and Polyhedral Outer Approximation . Mathematical Programming , 50 : 259 – 274 .
   Web of Science ®Google Scholar
• Horst , R. , Thoai , N.V. and De Vries , J. 1992 . A New Simplicial Cover Technique in Constrained Global Optimization . J of Global Optimization , 2 : 1 – 19 .
   Google Scholar
• Horst , R. , Thoai , N.V. and De Vries , J. 1991a . A New Conical Cover Technique in Concave Minimization , University of Trier . Preprint, Dept. Maths
   Google Scholar
• Horst , R. and Tuy , H. 1990 . Global Optimization (Deterministic Approaches) , Berlin : Springer .
   Google Scholar
• Tuy , H. 1991 . Effect of the Subdivision Strategy on Convergence and Efficiency of Some Global Optimization Algorithms . J of Global Optimization , 1 : 23 – 36 .
   Google Scholar
• Tuy , H. , Khachaturov , V. and Utkin , S. 1987 . A Class of Exhaustive Cone Splitting Procedures in Conical Algorithms for Concave Minimization . Optimization , 18 : 791 – 807 .
   Google Scholar