A derivative-free algorithm for unconstrained optimization

DOI10.1007/S11766-005-0029-1zbMath1190.90217OpenAlexW2330799949MaRDI QIDQ2501433

Yehui Peng, Zhen-Hai Liu

Publication date: 11 September 2006

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-005-0029-1

zbMATH Keywords

genetic algorithmglobal minimizerpattern search method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (3)

Asynchronous parallel hybrid optimization combining DIRECT and GSS ⋮ A novel bat algorithm based on cross boundary learning and uniform explosion strategy ⋮ Black-Box Optimization: Methods and Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Large Sample Properties of Simulations Using Latin Hypercube Sampling
• A Pattern Search Filter Method for Nonlinear Programming without Derivatives
• Pattern Search Algorithms for Bound Constrained Minimization

This page was built for publication: A derivative-free algorithm for unconstrained optimization