On geometry and convergence of a class of simplicial covers
- 1 January 1992
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 25 (1) , 53-64
- https://doi.org/10.1080/02331939208843807
Abstract
This article presents the fundamental mathematical properties of new simplicial and conical solution methods for concave minimization problems which uses a new simplicial cover rather than the classical radial partitioning techniques. In particular, a number of conditions is derived which ensure convergence of every decreasing sequence of simplices generated by the new technique to a singleton, a property which is fundamental for the convergence of related optimization methods. Moreover, a new estimate of the outer radius-diameter ratio is derived for generalized bisectionKeywords
This publication has 6 references indexed in Scilit:
- A new simplicial cover technique in constrained global optimizationJournal of Global Optimization, 1992
- Concave minimization via conical partitions and polyhedral outer approximationMathematical Programming, 1991
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithmsJournal of Global Optimization, 1991
- A branch and bound-outer approximation algorithm for concave minimization over a convex setComputers & Mathematics with Applications, 1991
- Global OptimizationPublished by Springer Nature ,1990
- A class of exhaustive cone splitting procedures in conical algorithms for concave minmizationOptimization, 1987