Systematic choice of initial points in local search: Extensions and application to neural networks
DOI10.1016/0020-0190(91)90182-HzbMATH Open0735.68022OpenAlexW2081378606MaRDI QIDQ1182102FDOQ1182102
Robert J. T. Morris, Wing Shing Wong
Publication date: 27 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(91)90182-h
Recommendations
- A new approach to choosing initial points in local search
- Optimization of the local search in the training for SAMANN neural network
- Advances in Neural Networks – ISNN 2005
- Extension of localised approximation by neural networks
- scientific article; zbMATH DE number 1841958
- An empirical study into finding optima in stochastic optimization of neural networks
- Local approximation on artificial neural networks
- scientific article; zbMATH DE number 5251967
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Searching and sorting (68P10) Neural networks for/in biological studies, artificial life and related topics (92B20)
Cites Work
- Analytic Inequalities
- On the Systematic Search in a Hypercube
- Title not available (Why is that?)
- An approach to nonlinear programming
- Title not available (Why is that?)
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Heuristic-Programming Solution of a Flowshop-Scheduling Problem
- Bayesian stopping rules for multistart global optimization methods
- Random optimization
- A new approach to choosing initial points in local search
Cited In (3)
This page was built for publication: Systematic choice of initial points in local search: Extensions and application to neural networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1182102)
