Continuous function optimisation via gradient descent on a neural network approximation function

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2084 LNCS, Issue PART 1, 2001, Pages 741-748

  Smith, Kate A ^a   Gupta, Jatinder N D ^b  

^a MONASH UNIVERSITY   (Australia)

^b BALL STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRADIENT METHODS; LYAPUNOV FUNCTIONS; OPTIMIZATION; ARTIFICIAL INTELLIGENCE; FEEDFORWARD NEURAL NETWORKS;

APPROXIMATED FUNCTIONS; APPROXIMATION FUNCTION; CONTINUOUS FUNCTIONS; CONTINUOUS OPTIMISATION; CONVERGENCE THEOREM; NEURAL NETWORK APPROXIMATION; OBJECTIVE FUNCTIONS; OPTIMISATION PROBLEMS;

FEEDFORWARD NEURAL NETWORKS; OPTIMIZATION;

EID: 23044527788     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45720-8_89     Document Type: Conference Paper

References (7)

1. K. A. Smith, "Neural Networks for Combinatorial Optimisation: a review of more than a decade of research", INFORMS Journal on Computing, vol. 11, no. 1, pp. 15-34, 1999.
2. J. J. Hopfield and D. W. Tank, " 'Neural' Computation of Decisions in Optimization Problems', Biological Cybernetics, vol. 52, pp. 141-152, 1985.
3. R. Durbin and D. Willshaw, "An analogue approach to the travelling salesman problem using an elastic net method", Nature, vol. 326, pp. 689-691, 1987.
4. K. Smith, M. Palaniswami and M. Krishnamoorthy, "Neural Techniques for Combinatorial Optimisation with Applications", IEEE Transactions on Neural Networks, vol. 9, no. 6, pp. 1301-1318, 1998.
5. K. A. De Jong, "An analysis of behavior of a class of genetic adaptive systems", Doctoral Dissertation, University of Michigan, Dissertation Abstracts International, vol. 36, no. 10, 5140B, 1975.
6. K. Hornik, M. Stinchcombe and H. White, "Multilayer feed forward networks are universal approximators", Neural Networks, vol. 2, pp. 359-366, 1989.
7. R. Barron, "Universal approximation bounds for superpositions of a sigmoidal function", IEEE Transactions on Information Theory, vol. 39, pp. 359-366, 1989.