Find out how to access previewonly content
Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
 Hoang Tuy
 … show all 1 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
We investigate subdivision strategies that can improve the convergence and efficiency of some branch and bound algorithms of global optimization. In particular, a general class of so called weakly exhaustive simplicial subdivision processes is introduced that subsumes all previously known radial exhaustive processes. This result provides the basis for constructing flexible subdivision strategies that can be adapted to take advantage of various problem conditions.
 Falk, J. E., Soland, R. M. (1969) An Algorithm for Separable Nonconvex Programming Problems. Management Science 15: pp. 550569
 Hamami, M., Jacobsen, S. E. (1988) Exhaustive Nondegenerate Conical Processes for Concave Minimization on Convex Polytope. Mathematics of Operations Research 13: pp. 479481
 Horst, R. (1976) An Algorithm for Nonconvex Programming Problems. Mathematical Programming 10: pp. 312321
 Horst, R., Thoai, N. V. (1989) Modification, Implementation and Comparison of Three Algorithms for Globally Solving Linearly Constrained Concave Minimization Problems. Computing 42: pp. 271289
 Horst, R. and Tuy, H. (1990), Global Optimization (Deterministic Approaches), SpringerVerlag.
 Kalantari, B., Rosen, J. B. (1987) An Algorithm for Global Mimization of Linearly Constrained Concave Quadratic Functions. Mathematics of Operations Research 12: pp. 544562
 Thoai, N. V., Tuy, H. (1980) Convergent Algorithm for Minimizing a Concave Function. Mathematics of Operations Research 5: pp. 556566
 Tuy, H. (1991), Normal Conical Algorithm for Concave Minimization, Mathematical Programming. Forthcoming.
 Tuy, H., Horst, R. (1988) Convergence and Restart in Branch and Bound Algorithms for Global Optimization. Application to Concave Minimization and D.C. Optimization Problems. Mathematical Programming 41: pp. 161183
 Tuy, H. and Horst, R. (submitted), The Geometric Complementarity Problem and Transcending Stationarity in Global Optimization.
 Tuy, H., Khachaturov, V., Utkin, S. (1987) A Class of Exhaustive Cone Splitting Procedures in Conical Algorithms for Concave Minimization. Optimization 18: pp. 791807
 Utkin, S., Khachaturov, V., Tuy, H. (1988) On Conical Algorithms for Solving Concave Programming Problems and Some of Their Extensions. USSR Computational Mathematics and Mathematical Physics 28: pp. 992999
 Title
 Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
 Journal

Journal of Global Optimization
Volume 1, Issue 1 , pp 2336
 Cover Date
 19910301
 DOI
 10.1007/BF00120663
 Print ISSN
 09255001
 Online ISSN
 15732916
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 Branch and bound
 global optimization
 subdivision strategy
 exhaustive and weakly exhaustive subdivision processes
 Industry Sectors
 Authors

 Hoang Tuy ^{(1)}
 Author Affiliations

 1. Institute of Mathematics, Hanoi, Vietnam