A Heuristic Search Procedure for Estimating a Global Solution of Nonconvex Programming Problems

This paper develops a penalty function and several techniques for searching nonconvex areas for a global optimum and presents numerical results for several small though very difficult nonconvex programming problems. No proofs of convergence have been obtained, nor has it been possible to categorize the types of problems for which these techniques are successful.