The Shape of a Local Minimum and the Probability of its Detection in Random Search
From MaRDI portal
(Redirected from Publication:3564527)
Recommendations
- A random search approach to finding the global minimum
- scientific article; zbMATH DE number 1054958
- On the local minima of the order of appearance function
- On Random Search for a Global Extremum
- Estimating the minimal value of a function in global random search: comparison of estimation procedures
- Stochastic approximation of global minimum points
- The depth and width of local minima in discrete solution spaces
- Comparison of some random search procedures for a global extremum
Cites work
- ``Neural computation of decisions in optimization problems
- Application of statistical mechanics to NP-complete problems in combinatorial optimisation
- Hopfield neural networks for optimization: Study of the different dynamics
- Neural networks and physical systems with emergent collective computational abilities
- Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
- New Optimization Algorithms in Physics
- Regularization algorithms for learning that are equivalent to multilayer networks
Cited in
(6)- Topology trivialization and large deviations for the minimum in the simplest random optimization
- Generalized Bragg-Williams equation for systems with an arbitrary long-range interaction
- Increasing the attraction area of the global minimum in the binary optimization problem
- A relation between the depth of a local minimum and the probability of its detection in the generalized Hopfield model
- Discretization of a matrix in quadratic functional binary optimization
- Transformation of energy landscape in the problem of binary minimization
This page was built for publication: The Shape of a Local Minimum and the Probability of its Detection in Random Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564527)