Basic principles of annealing for large scale nonlinear optimization
From MaRDI portal
Recommendations
- Multiscale annealing and robustness: Fast heuristics for large scale nonlinear optimization
- Tuned annealing for optimization
- Simulated annealing with asymptotic convergence for nonlinear constrained optimization
- Annealing of Iterative Stochastic Schemes
- Simulated Annealing for Convex Optimization
- Simulated annealing with asymptotic convergence for nonlinear constrained global optimization
- Annealing adaptive search, cross-entropy, and stochastic approximation in global optimization
- scientific article; zbMATH DE number 1054758
Cited in
(7)- Hierarchical annealing for synthesis of binary images
- Constraint selection and deterministic annealing
- Dual mean field search for large scale linear and quadratic knapsack problems
- Smooth curve extraction by mean field annealing
- Multiscale annealing and robustness: Fast heuristics for large scale nonlinear optimization
- Optimization by stochastic continuation
- A review on deterministic annealing algorithms based on entropy constraints
This page was built for publication: Basic principles of annealing for large scale nonlinear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2762581)
