论文信息 - A Heuristic Search Procedure for Estimating a Global Solution of Nonconvex Programming Problems

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.

Rick Hesse

[1] Anthony V. Fiacco,et al. The Sequential Unconstrained Minimization Technique for Nonlinear Programing, a Primal-Dual Method , 1964 .

[2] H. H. Rosenbrock,et al. An Automatic Method for Finding the Greatest or Least Value of a Function , 1960, Comput. J..

[3] A. Leon,et al. A comparison among eight known optimizing procedures. , 1966 .

[4] L. Cooper,et al. Sequential Search: A Method for Solving Constrained Optimization Problems , 1965, JACM.

[5] Anthony V. Fiacco,et al. Computational Algorithm for the Sequential Unconstrained Minimization Technique for Nonlinear Programming , 1964 .

[6] Robert J. Townsley,et al. THE MAXIMIZATION OF A QUADRATIC FUNCTION OF VARIABLES SUBJECT TO LINEAR INEQUALITIES*t , 1964 .

[7] R. E. Griffith,et al. A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems , 1961 .

[8] E. M. L. Beale,et al. Nonlinear and Dynamic Programming , 1965 .