An efficient hybrid algorithm for the optimization of problems with several local minima

DOI<847::AID-NME54>3.0.CO;2-Q 10.1002/1097-0207(20010210)50:4<847::AID-NME54>3.0.CO;2-QzbMath0986.65059OpenAlexW1987992577MaRDI QIDQ2709630

No author found.

Publication date: 2001

Full work available at URL: https://doi.org/10.1002/1097-0207(20010210)50:4<847::aid-nme54>3.0.co;2-q

zbMATH Keywords

interpolationstochastic optimizationfinite element analysisoptimization algorithmsdirect optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Finite element, Galerkin and related methods applied to problems in optics and electromagnetic theory (78M10)

Related Items (4)

Note on the determination of the ignition point in forest fires propagation using a control algorithm ⋮ Comparison of multi‐objective optimisation approaches for inverse magnetostatic problems ⋮ A fast algorithm for inversion of MLP networks in design problems ⋮ A constructive algorithm of neural approximation models for optimization problems

Cites Work

• Theory and applications of the multiquadric-biharmonic method. 20 years of discovery 1968-1988
• Very fast simulated re-annealing
• Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
• Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient hybrid algorithm for the optimization of problems with several local minima