A Robust Algorithm for Solving Nonlinear Programming Problems

DOI10.1080/00207160210947zbMath0999.65053OpenAlexW1989286220MaRDI QIDQ4543516

Lishan Kang, Hugo de Garis, Yan Li, Zhuo Kang, Pu Liu

Publication date: 5 December 2002

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

numerical experimentsnonlinear programmingevolutionary algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (5)

Multi-modal function optimization with the ZEDS (zoomed evolutionary dual strategy) algorithmzoomed evolutionary algorithm ⋮ An accelerating algorithm for globally solving nonconvex quadratic programming ⋮ Adapting derivative free optimization methods to engineering models with discrete variables ⋮ A two-level subspace evolutionary algorithm for solving multi-modal function optimization problems ⋮ An efficient dynamical evolutionary algorithm for global optimization

Cites Work

• Test examples for nonlinear programming codes
• On the convergence rates of genetic algorithms
• A new evolutionary algorithm for function optimization

This page was built for publication: A Robust Algorithm for Solving Nonlinear Programming Problems