Nonlinear optimization of constrained functions using tabu search

DOI10.1080/0020739930240515zbMath0807.90102OpenAlexW2078046549MaRDI QIDQ4299887

J. A. Bland

Publication date: 15 August 1994

Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020739930240515

zbMATH Keywords

tabu searchconstrained nonlinear optimizationdirect search algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions ⋮ Global optimization for artificial neural networks: A tabu search application

Cites Work

• Tabu search and design optimization
• Future paths for integer programming and links to artificial intelligence
• `` Direct Search Solution of Numerical and Statistical Problems
• Function minimization by conjugate gradients
• A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
• A Survey of Numerical Methods for Unconstrained Optimization
• On the Convergence of the Variable Metric Algorithm
• The analysis of randomized experiments with orthogonal block structure. I. Block structure and the null analysis of variance

This page was built for publication: Nonlinear optimization of constrained functions using tabu search