-
1 метод имитации отжига
1) Mathematics: simulated annealing2) Information technology: simulated anneal (для обучения нейронных сетей), simulated annealing method (для обучения нейронных сетей)Универсальный русско-английский словарь > метод имитации отжига
-
2 метод имитации отжига
( для обучения нейронных сетей) mean field anneal, simulated anneal, simulated annealing methodРусско-английский словарь по электронике > метод имитации отжига
-
3 метод имитации отжига
( для обучения нейронных сетей) mean field anneal, simulated anneal, simulated annealing methodРусско-английский словарь по радиоэлектронике > метод имитации отжига
-
4 метод моделирования отжига
Makarov: simulated annealing methodУниверсальный русско-английский словарь > метод моделирования отжига
-
5 метод принудительного отжига
Makarov: simulated annealing methodУниверсальный русско-английский словарь > метод принудительного отжига
См. также в других словарях:
Simulated annealing — (SA) is a generic probabilistic meta algorithm for the global optimization problem, namely locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g.,… … Wikipedia
Annealing — may refer to: *Annealing (metallurgy), a heat treatment that alters the microstructure of a material causing changes in properties such as strength and hardness *Annealing (glass), heating a piece of glass to remove stress *Annealing (biology),… … Wikipedia
Quantum annealing — In mathematics and applications, quantum annealing (QA) is a general method for finding the global minimum of a given objective function over a given set of candidate solutions (the search space ), by a process analogous to quantum fluctuations.… … Wikipedia
Monte Carlo method — Not to be confused with Monte Carlo algorithm. Computational physics … Wikipedia
Newton's method — In numerical analysis, Newton s method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real valued function. The… … Wikipedia
Iterative method — In computational mathematics, an iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. A specific implementation of an iterative method, including the termination… … Wikipedia
Newton's method in optimization — A comparison of gradient descent (green) and Newton s method (red) for minimizing a function (with small step sizes). Newton s method uses curvature information to take a more direct route. In mathematics, Newton s method is an iterative method… … Wikipedia
Nelder–Mead method — Nelder–Mead simplex search over the Rosenbrock banana function (above) and Himmelblau s function (below) See simplex algorithm for Dantzig s algorithm for the problem of linear opti … Wikipedia
Cutting-plane method — In mathematical optimization, the cutting plane method is an umbrella term for optimization methods which iteratively refine a feasible set or objective function by means of linear inequalities, termed cuts. Such procedures are popularly used to… … Wikipedia
Nelder-Mead method — See simplex algorithm for the numerical solution of the linear programming problem. The Nelder Mead method or downhill simplex method or amoeba method is a commonly used nonlinear optimization algorithm. It is due to John Nelder R. Mead (1965)… … Wikipedia
Nonlinear conjugate gradient method — In numerical optimization, the nonlinear conjugate gradient method generalizes the conjugate gradient method to nonlinear optimization. For a quadratic function : The minimum of f is obtained when the gradient is 0: . Whereas linear conjugate… … Wikipedia