Used genetic algorithm (GA) to optimize the network of ventilation in order toavoid artificial convergence and speed up the convergence rate to introduce the Powellalgorithm. The Powell algorithm had been integrated i...Used genetic algorithm (GA) to optimize the network of ventilation in order toavoid artificial convergence and speed up the convergence rate to introduce the Powellalgorithm. The Powell algorithm had been integrated into GA. Powell had the effectivecapacity of solving the local optimal solution. Powell and the cross as a method ofchoice, a variation of the parallel operator, can be a better solution to the prematureconvergence of the GA problem. The two methods will be improved to make it an effective combination of hybrid GA called hybrid genetic algorithm (HGA) for the introductionof mine ventilation network optimization and to be used to solve the problem of regulating mine optimization.展开更多
In this paper,by utilizing the angle of arrivals(AOAs) and imprecise positions of the sensors,a novel modified Levenberg-Marquardt algorithm to solve the source localization problem is proposed.Conventional source loc...In this paper,by utilizing the angle of arrivals(AOAs) and imprecise positions of the sensors,a novel modified Levenberg-Marquardt algorithm to solve the source localization problem is proposed.Conventional source localization algorithms,like Gauss-Newton algorithm and Conjugate gradient algorithm are subjected to the problems of local minima and good initial guess.This paper presents a new optimization technique to find the descent directions to avoid divergence,and a trust region method is introduced to accelerate the convergence rate.Compared with conventional methods,the new algorithm offers increased stability and is more robust,allowing for stronger non-linearity and wider convergence field to be identified.Simulation results demonstrate that the proposed algorithm improves the typical methods in both speed and robustness,and is able to avoid local minima.展开更多
In this paper,a fast neural network model for the forecasting of effective points by DEA model is proposed,which is based on the SPDS training algorithm.The SPDS training algorithm overcomes the drawbacks of slow conv...In this paper,a fast neural network model for the forecasting of effective points by DEA model is proposed,which is based on the SPDS training algorithm.The SPDS training algorithm overcomes the drawbacks of slow convergent speed and partially minimum result for BP algorithm.Its training speed is much faster and its forecasting precision is much better than those of BP algorithm.By numeric examples,it is showed that adopting the neural network model in the forecasting of effective points by DEA model is valid.展开更多
To deal with the demerits of constriction particle swarm optimization(CPSO), such as relapsing into local optima, slow convergence velocity, a modified CPSO algorithm is proposed by improving the velocity update formu...To deal with the demerits of constriction particle swarm optimization(CPSO), such as relapsing into local optima, slow convergence velocity, a modified CPSO algorithm is proposed by improving the velocity update formula of CPSO. The random velocity operator from local optima to global optima is added into the velocity update formula of CPSO to accelerate the convergence speed of the particles to the global optima and reduce the likelihood of being trapped into local optima. Finally the convergence of the algorithm is verified by calculation examples.展开更多
The locally optimal block preconditioned 4-d conjugate gradient method(LOBP4dC G) for the linear response eigenvalue problem was proposed by Bai and Li(2013) and later was extended to the generalized linear response e...The locally optimal block preconditioned 4-d conjugate gradient method(LOBP4dC G) for the linear response eigenvalue problem was proposed by Bai and Li(2013) and later was extended to the generalized linear response eigenvalue problem by Bai and Li(2014). We put forward two improvements to the method: A shifting deflation technique and an idea of extending the search subspace. The deflation technique is able to deflate away converged eigenpairs from future computation, and the idea of extending the search subspace increases convergence rate per iterative step. The resulting algorithm is called the extended LOBP4 dC G(ELOBP4dC G).Numerical results of the ELOBP4 dC G strongly demonstrate the capability of deflation technique and effectiveness the search space extension for solving linear response eigenvalue problems arising from linear response analysis of two molecule systems.展开更多
基金Supported by the National Natural Science Foundation of China(60772159)
文摘Used genetic algorithm (GA) to optimize the network of ventilation in order toavoid artificial convergence and speed up the convergence rate to introduce the Powellalgorithm. The Powell algorithm had been integrated into GA. Powell had the effectivecapacity of solving the local optimal solution. Powell and the cross as a method ofchoice, a variation of the parallel operator, can be a better solution to the prematureconvergence of the GA problem. The two methods will be improved to make it an effective combination of hybrid GA called hybrid genetic algorithm (HGA) for the introductionof mine ventilation network optimization and to be used to solve the problem of regulating mine optimization.
基金Supported by the National High Technology Research and Development Programme of China(No.2011AA7014061)
文摘In this paper,by utilizing the angle of arrivals(AOAs) and imprecise positions of the sensors,a novel modified Levenberg-Marquardt algorithm to solve the source localization problem is proposed.Conventional source localization algorithms,like Gauss-Newton algorithm and Conjugate gradient algorithm are subjected to the problems of local minima and good initial guess.This paper presents a new optimization technique to find the descent directions to avoid divergence,and a trust region method is introduced to accelerate the convergence rate.Compared with conventional methods,the new algorithm offers increased stability and is more robust,allowing for stronger non-linearity and wider convergence field to be identified.Simulation results demonstrate that the proposed algorithm improves the typical methods in both speed and robustness,and is able to avoid local minima.
基金Sponsored by the Natural Scientific Research Foundation of Heilongjiang Province(Grant No.40000045-6-07259)the Natural Scientific Research Inno-vation Foundation of Harbin Institute of Technology(Grant No.HIT.NSRIF.2008.59)+1 种基金the Scientific and Technology Critical Project of Harbin,Hei-longjiang Province(2004)the National Soft Science Key Foundation(Grant No.2008GXS5D113)
文摘In this paper,a fast neural network model for the forecasting of effective points by DEA model is proposed,which is based on the SPDS training algorithm.The SPDS training algorithm overcomes the drawbacks of slow convergent speed and partially minimum result for BP algorithm.Its training speed is much faster and its forecasting precision is much better than those of BP algorithm.By numeric examples,it is showed that adopting the neural network model in the forecasting of effective points by DEA model is valid.
基金supported by the National Natural Science Foundation of China(71171015)the National High Technology Research and Development Program(863 Program)(2012AA112403)
文摘To deal with the demerits of constriction particle swarm optimization(CPSO), such as relapsing into local optima, slow convergence velocity, a modified CPSO algorithm is proposed by improving the velocity update formula of CPSO. The random velocity operator from local optima to global optima is added into the velocity update formula of CPSO to accelerate the convergence speed of the particles to the global optima and reduce the likelihood of being trapped into local optima. Finally the convergence of the algorithm is verified by calculation examples.
基金supported by National Science Foundation of USA(Grant Nos.DMS1522697,CCF-1527091,DMS-1317330 and CCF-1527091)National Natural Science Foundation of China(Grant No.11428104)
文摘The locally optimal block preconditioned 4-d conjugate gradient method(LOBP4dC G) for the linear response eigenvalue problem was proposed by Bai and Li(2013) and later was extended to the generalized linear response eigenvalue problem by Bai and Li(2014). We put forward two improvements to the method: A shifting deflation technique and an idea of extending the search subspace. The deflation technique is able to deflate away converged eigenpairs from future computation, and the idea of extending the search subspace increases convergence rate per iterative step. The resulting algorithm is called the extended LOBP4 dC G(ELOBP4dC G).Numerical results of the ELOBP4 dC G strongly demonstrate the capability of deflation technique and effectiveness the search space extension for solving linear response eigenvalue problems arising from linear response analysis of two molecule systems.
