Abstract
Radial Basis Function Neural Networks (RBF NN) are a tool largely used for regression problems. The principal drawback of this kind of predictive tool is that the optimization problem solved to train the network can be non-convex. On the other hand Canonical Duality Theory offers a powerful procedure to reformulate general non-convex problems in dual forms so that it is possible to find optimal solutions and to get deep insights into the nature of the challenging problems. By combining the canonical duality theory with the RBF NN, this paper presents a potentially useful method for solving challenging problems in real-world applications.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Haykin S (1999) Neural networks, a comprehensive foundation. Prentice-Hall, Prentice
Buzzi C, Grippo L, Sciandrone M (2001) Convergent decomposition techniques for training RBF neural networks. Neural Comput 13:1891–1920
Gao DY (2000) Duality principles in nonconvex systems: theory, methods, and applications. Kluwer Academic Publishers, Dordrecht Nonconvex Optimization and Its Applications
Gao DY, Ruan N, Pardalos PM (2011) Canonical dual solutions to sum of fourth-order polynomials minimization problems with applications to sensor network localization. In: Pardalos PM, Boginski V, Commander C (eds) Sensors: theory, algorithms and applications. Springer, New York
Gao DY, Wu CZ (2012) On the triality theory for a quartic polynomial optimization problem. J Ind Manage Optim 8(1):229–242
Zhang J, Gao DY, Yearwood J (2011) A novel canonical dual computational approach for prion AGAAAAGA amyloid fibril molecular modeling. J Theor Biol 284:149–157. doi:10.1080/10556788.2011.641125
Santos HAFA, Gao DY (2012) Canonical dual finite element method for solving post-buckling problems of a large deformation elastic beam. Int J Nonlinear Mech 47:240–247. doi:10.1016/j.ijnonlinmec.2011.05.012
Gao DY (2009) Canonical duality theory: theory, method, and applications in global optimization. Comput Chem 33:1964–1972
Gao DY, Watson LT, Easterling DR, Thacker WI, Billups SC (2011) Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm. Optim Methods Softw. doi:10.1080/10556788.2011.641125
Acknowledgement
This research is supported by US Air Force Office of Scientific Research under the grant AFOSR FA9550-10-1-0487.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Latorre, V., Gao, D.Y. (2013). Canonical Duality for Radial Basis Neural Networks. In: Yin, Z., Pan, L., Fang, X. (eds) Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013. Advances in Intelligent Systems and Computing, vol 212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37502-6_139
Download citation
DOI: https://doi.org/10.1007/978-3-642-37502-6_139
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37501-9
Online ISBN: 978-3-642-37502-6
eBook Packages: EngineeringEngineering (R0)