Systematic choice of initial points in local search: Extensions and application to neural networks
From MaRDI portal
Publication:1182102
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
Cites work
- scientific article; zbMATH DE number 3841285 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A new approach to choosing initial points in local search
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An approach to nonlinear programming
- Analytic Inequalities
- Bayesian stopping rules for multistart global optimization methods
- Heuristic-Programming Solution of a Flowshop-Scheduling Problem
- On the Systematic Search in a Hypercube
- Random optimization
Cited in
(4)- A new approach to choosing initial points in local search
- Learning to sample initial solution for solving 0-1 discrete optimization problem by local search
- Optimization of the local search in the training for SAMANN neural network
- scientific article; zbMATH DE number 3843529 (Why is no real title available?)
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)