Coordinate descent method is a unconstrained optimization technique. When it is applied to support vector machine （SVM）, at each step the method updates one component of w by solving a one-variable sub-problem while...Coordinate descent method is a unconstrained optimization technique. When it is applied to support vector machine （SVM）, at each step the method updates one component of w by solving a one-variable sub-problem while fixing other components. All components of w update after one iteration. Then go to next iteration. Though the method converges and converges fast in the beginning, it converges slow for final convergence. To improve the speed of final convergence of coordinate descent method, Hooke and Jeeves algorithm which adds pattern search after every iteration in coordinate descent method was applied to SVM and a global Newton algorithm was used to solve one-variable subproblems. We proved the convergence of the algorithm. Experimental results show Hooke and Jeeves＇ method does accelerate convergence specially for final convergence and achieves higher testing accuracy more quickly in classification.展开更多
AISI 304L is an austenitic Chromium-Nickel stainless steel offering the optimum combination of corrosion resistance, strength and ductility. These attributes make it a favorite for many mechanical components. The pape...AISI 304L is an austenitic Chromium-Nickel stainless steel offering the optimum combination of corrosion resistance, strength and ductility. These attributes make it a favorite for many mechanical components. The paper focuses on developing mathematical models to predict grain size and hardness of pulsed current micro plasma arc welded AISI 304L joints. Four factors, five level, central composite rotatable design matrix is used to optimize the number of experiments. The mathematical models have been developed by Response Surface Method (RSM) and its adequacy is checked by Analysis of Variance (ANOVA) technique. By using the developed mathematical models, grain size and hardness of the weld joints can be predicted with 99% confidence level. The developed mathematical models have been optimized using Hooke and Jeeves algorithm to minimize grain size and maximize the hardness.展开更多
The backtracking search optimization algorithm（BSA） is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powe...The backtracking search optimization algorithm（BSA） is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powerful capability to find global optimal solutions. However, the algorithm is still insufficient in balancing the exploration and the exploitation. Therefore, an improved adaptive backtracking search optimization algorithm combined with modified Hooke-Jeeves pattern search is proposed for numerical global optimization. It has two main parts： the BSA is used for the exploration phase and the modified pattern search method completes the exploitation phase. In particular, a simple but effective strategy of adapting one of BSA＇s important control parameters is introduced. The proposed algorithm is compared with standard BSA, three state-of-the-art evolutionary algorithms and three superior algorithms in IEEE Congress on Evolutionary Computation 2014（IEEE CEC2014） over six widely-used benchmarks and 22 real-parameter single objective numerical optimization benchmarks in IEEE CEC2014. The results of experiment and statistical analysis demonstrate the effectiveness and efficiency of the proposed algorithm.展开更多
提出了一种混合演化算法求解多目标优化问题.演化算法是解决多目标优化问题的有效方法,在全局优化问题中具有很好的鲁棒性,但其局部搜索性能有待改善.Hooke and Jeeves方法是一经典的局部搜索算法,将其与演化算法结合求解多目标优化问题...提出了一种混合演化算法求解多目标优化问题.演化算法是解决多目标优化问题的有效方法,在全局优化问题中具有很好的鲁棒性,但其局部搜索性能有待改善.Hooke and Jeeves方法是一经典的局部搜索算法,将其与演化算法结合求解多目标优化问题,提高了解的收敛质量,因而从整体上提高了算法的性能,并且测试结果也说明了该算法的可行性.展开更多
基金supported by the National Natural Science Foundation of China (6057407560705004)
文摘Coordinate descent method is a unconstrained optimization technique. When it is applied to support vector machine （SVM）, at each step the method updates one component of w by solving a one-variable sub-problem while fixing other components. All components of w update after one iteration. Then go to next iteration. Though the method converges and converges fast in the beginning, it converges slow for final convergence. To improve the speed of final convergence of coordinate descent method, Hooke and Jeeves algorithm which adds pattern search after every iteration in coordinate descent method was applied to SVM and a global Newton algorithm was used to solve one-variable subproblems. We proved the convergence of the algorithm. Experimental results show Hooke and Jeeves＇ method does accelerate convergence specially for final convergence and achieves higher testing accuracy more quickly in classification.
文摘AISI 304L is an austenitic Chromium-Nickel stainless steel offering the optimum combination of corrosion resistance, strength and ductility. These attributes make it a favorite for many mechanical components. The paper focuses on developing mathematical models to predict grain size and hardness of pulsed current micro plasma arc welded AISI 304L joints. Four factors, five level, central composite rotatable design matrix is used to optimize the number of experiments. The mathematical models have been developed by Response Surface Method (RSM) and its adequacy is checked by Analysis of Variance (ANOVA) technique. By using the developed mathematical models, grain size and hardness of the weld joints can be predicted with 99% confidence level. The developed mathematical models have been optimized using Hooke and Jeeves algorithm to minimize grain size and maximize the hardness.
基金supported by the National Natural Science Foundation of China(61271250)
文摘The backtracking search optimization algorithm（BSA） is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powerful capability to find global optimal solutions. However, the algorithm is still insufficient in balancing the exploration and the exploitation. Therefore, an improved adaptive backtracking search optimization algorithm combined with modified Hooke-Jeeves pattern search is proposed for numerical global optimization. It has two main parts： the BSA is used for the exploration phase and the modified pattern search method completes the exploitation phase. In particular, a simple but effective strategy of adapting one of BSA＇s important control parameters is introduced. The proposed algorithm is compared with standard BSA, three state-of-the-art evolutionary algorithms and three superior algorithms in IEEE Congress on Evolutionary Computation 2014（IEEE CEC2014） over six widely-used benchmarks and 22 real-parameter single objective numerical optimization benchmarks in IEEE CEC2014. The results of experiment and statistical analysis demonstrate the effectiveness and efficiency of the proposed algorithm.
文摘提出了一种混合演化算法求解多目标优化问题.演化算法是解决多目标优化问题的有效方法,在全局优化问题中具有很好的鲁棒性,但其局部搜索性能有待改善.Hooke and Jeeves方法是一经典的局部搜索算法,将其与演化算法结合求解多目标优化问题,提高了解的收敛质量,因而从整体上提高了算法的性能,并且测试结果也说明了该算法的可行性.
