The Program Verification of the Three-Seeking and Six-Seeking Method Based on the Conjugate Direction

摘要

Conjugate direction is a better direction of optimization. The three-seeking method and the six-seeking method based on conjugate direction have strong theoretical. Using the advantages of one-dimensional blind walking optimization algorithm, the optimal point was given on the given direction. Three optimization method, six optimization method and computer program for the blind walking algorithm for 3D design space were put forward. The given programs were of universal significance. The results show that the three-seeking method and the six-seeking method have better performance than the negative gradient method.