A Robust Algorithm for Solving Nonlinear Programming Problems

DOI10.1080/00207160210947MaRDI QIDQ4543516zbMATH OpenOpenAlexFDO

Authors Yan Li, Lishan Kang, Hugo de Garis, 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

nonlinear programmingevolutionary algorithmnumerical experiments

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5251971
• Global optimal algorithm for linear programming problems subjected to nonlinear constraints
• scientific article; zbMATH DE number 621945
• An improved differential evolution algorithm for nonlinear mixed-integer programming problems
• A linear programming-based optimization algorithm for solving nonlinear programming problems

Cites work

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

Cited in

(7)

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

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

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