Dynamic filled algorithm for global optimization of nonlinear programming
暂无分享,去创建一个
[1] J J Hopfield,et al. Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.
[2] Leon O. Chua,et al. Neural networks for nonlinear programming , 1988 .
[3] Yong Yao,et al. Dynamic tunneling algorithm for global optimization , 1989, IEEE Trans. Syst. Man Cybern..
[4] Renpu Ge,et al. A Filled Function Method for Finding a Global Minimizer of a Function of Several Variables , 1990, Math. Program..
[5] Michael A. Shanblatt,et al. Linear and quadratic programming neural network analysis , 1992, IEEE Trans. Neural Networks.
[6] Xian Liu. Finding Global Minima with a Computable Filled Function , 2001, J. Glob. Optim..
[7] Panos M. Pardalos,et al. Filled functions for unconstrained global optimization , 2001, J. Glob. Optim..
[8] Vikram Krishnamurthy,et al. IEEE Transactions on Circuits and Systems II: Express Briefs , 2004 .
[9] R. Martin,et al. Linear and Quadratic Programming , 2005 .
[10] Liansheng Zhang,et al. A filled function method for global optimization , 2007 .
[11] Wei Wang,et al. Simple transformation functions for finding better minima , 2008, Appl. Math. Lett..