An approach to multi-start clustering for global optimization with non-linear constraints

DOI10.1002/nme.401zbMath0995.65066OpenAlexW2136494777MaRDI QIDQ4530126

No author found.

Publication date: 27 October 2002

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.401

zbMATH Keywords

global optimizationnumerical resultsquadratic programmingconstrained optimizationsimulated annealingrandom searchmulti-start with clustering strategy

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items

Studies of multi-start clustering for global optimization, Seeking global edges for traveling salesman problem in multi-start search, Towards ``Ideal multistart. A stochastic approach for locating the minima of a continuous function inside a bounded domain

Uses Software

• IMSL Numerical Libraries

Cites Work

• More test examples for nonlinear programming codes
• Test examples for nonlinear programming codes
• Integral global minimization: Algorithms, implementations and numerical tests
• Algorithms for nonlinear constraints that use lagrangian functions
• Studies of multi-start clustering for global optimization
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
• Unnamed Item