Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms

Journal of Global Optimization

Volumn 1, Issue 1, 1991, Pages 23-36

  Tuy, Hoang ^a  

^a INSTITUTE OF MATHEMATICS   (Viet Nam)

Author keywords

Branch and bound; exhaustive and weakly exhaustive subdivision processes; global optimization; subdivision strategy

Indexed keywords

EID: 0002407954     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/BF00120663     Document Type: Article

References (12)

1. An Algorithm for Separable Nonconvex Programming Problems
2. Exhaustive Nondegenerate Conical Processes for Concave Minimization on Convex Polytope
3. An Algorithm for Nonconvex Programming Problems
4. Modification, Implementation and Comparison of Three Algorithms for Globally Solving Linearly Constrained Concave Minimization Problems
5. An Algorithm for Global Mimization of Linearly Constrained Concave Quadratic Functions
6. Convergent Algorithm for Minimizing a Concave Function
7. Convergence and Restart in Branch and Bound Algorithms for Global Optimization. Application to Concave Minimization and D.C. Optimization Problems
8. A Class of Exhaustive Cone Splitting Procedures in Conical Algorithms for Concave Minimization
9. On Conical Algorithms for Solving Concave Programming Problems and Some of Their Extensions