Comparative analysis of the cutting angle and simulated annealing methods in global optimization

DOI10.1080/02331930310001611565MaRDI QIDQ4467167zbMATH OpenOpenAlexFDO

Authors Jaipu Zhang, A. M. Bagirov

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms (68W40) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Recommendations

• A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization
• A hybrid descent method for global optimization
• The impelling function method applied to global optimization
• scientific article; zbMATH DE number 4112399
• Modified versions of the cutting angle method.

Cites work

• scientific article; zbMATH DE number 41891 (Why is no real title available?)
• scientific article; zbMATH DE number 1232092 (Why is no real title available?)
• A tabu search Hooke and Jeeves algorithm for unconstrained optimization
• Abstract convexity and global optimization
• Algorithms for the solution of quadratic knapsack problems
• An adaptive simulated annealing algorithm for global optimization over continuous variables
• Computational Experience with Generalized Simulated Annealing Over Continuous Variables
• Cutting angle method and a local search
• Cutting angle methods in global optimization
• Fast algorithm for the cutting angle method of global optimization
• Generalized descent for global optimization
• Global minimization of increasing positively homogeneous functions over the unit simplex
• Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
• Introduction to global optimization
• Lipschitz programming via increasing convex-along-rays functions^*
• Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
• Optimization by simulated annealing
• Simulated annealing algorithms for continuous global optimization: Convergence conditions
• Simulated annealing for constrained global optimization
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

Cited in

(4)

• Optimization of a highway project planning using a modified genetic algorithm
• Optimal atomic-resolution structures of prion AGAAAAGA amyloid fibrils
• Local optimization method with global multidimensional search
• Cutting angle methods in global optimization

Describes a project that uses

Uses Software

• simannf90
• Global Optimization Toolbox For Maple

This page was built for publication: Comparative analysis of the cutting angle and simulated annealing methods in global optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4467167)