The Shape of a Local Minimum and the Probability of its Detection in Random Search
From MaRDI portal
Publication:3564527
DOI10.1007/978-3-540-85640-5_4zbMath1193.90120OpenAlexW2138658369MaRDI QIDQ3564527
Vladimir Kryzhanovsky, Andrey Mikaelian, B. V. Kryzhanovskii
Publication date: 2 June 2010
Published in: Informatics in Control, Automation and Robotics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85640-5_4
Related Items (4)
Transformation of energy landscape in the problem of binary minimization ⋮ Increasing the attraction area of the global minimum in the binary optimization problem ⋮ Discretization of a matrix in quadratic functional binary optimization ⋮ Generalized Bragg-Williams equation for systems with an arbitrary long-range interaction
Cites Work
- ``Neural computation of decisions in optimization problems
- Regularization Algorithms for Learning That Are Equivalent to Multilayer Networks
- New Optimization Algorithms in Physics
- Application of statistical mechanics to NP-complete problems in combinatorial optimisation
- Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
- Neural networks and physical systems with emergent collective computational abilities.
- Hopfield neural networks for optimization: Study of the different dynamics
This page was built for publication: The Shape of a Local Minimum and the Probability of its Detection in Random Search