scientific article; zbMATH DE number 749354

MaRDI QIDQ4697633zbMATH OpenFDO

Authors Bernard K. Cheung, Albert C. L. Ng

Publication date 7 May 1995

zbMATH Keywords

grid searchnonsmooth nonlinear unconstrained optimizationsearch algorithm

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Efficient Implementation of the Nelder-Mead Search Algorithm
• CARTopt: a random search method for nonsmooth unconstrained optimization
• A direct search quasi-Newton method for nonsmooth unconstrained optimization
• scientific article; zbMATH DE number 1217580
• A trust region algorithm for nonsmooth optimization

Cited in

(8)

• Coupling genetic algorithm with a grid search method to solve mixed integer nonlinear programming problems
• Increasing the efficiency of selected grid search procedures through the introduction of a best step mechanism
• scientific article; zbMATH DE number 176308 (Why is no real title available?)
• A reliable affine relaxation method for global optimization
• A modified affine scaling methodology for nonsmooth optimization
• Metaheuristics: A Canadian Perspective
• Algorithms for construction of efficient frontier for nonconvex models on the basis of optimization methods
• A nonsmooth version of the univariate optimization algorithm for locating the nearest extremum (locating extremum in nonsmooth univariate optimization)

This page was built for publication:

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