Comparative analysis of the cutting angle and simulated annealing methods in global optimization
From MaRDI portal
Publication:4467167
DOI10.1080/02331930310001611565zbMath1100.68653OpenAlexW2022826851MaRDI QIDQ4467167
Publication date: 9 June 2004
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/62224
Analysis of algorithms (68W40) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items (3)
Optimal atomic-resolution structures of prion AGAAAAGA amyloid fibrils ⋮ Optimization of a highway project planning using a modified genetic algorithm ⋮ Local optimization method with global multidimensional search
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Algorithms for the solution of quadratic knapsack problems
- Generalized descent for global optimization
- A tabu search Hooke and Jeeves algorithm for unconstrained optimization
- Simulated annealing for constrained global optimization
- Cutting angle method and a local search
- Cutting angle methods in global optimization
- Fast algorithm for the cutting angle method of global optimization
- An adaptive simulated annealing algorithm for global optimization over continuous variables
- Introduction to global optimization
- Simulated annealing algorithms for continuous global optimization: Convergence conditions
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
- Lipschitz programming via increasing convex-along-rays functions*
- Computational Experience with Generalized Simulated Annealing Over Continuous Variables
- Global minimization of increasing positively homogeneous functions over the unit simplex
- Abstract convexity and global optimization
This page was built for publication: Comparative analysis of the cutting angle and simulated annealing methods in global optimization
