scientific article; zbMATH DE number 1057701

MaRDI QIDQ4352745zbMATH OpenFDO

Authors Zelda B. Zabinsky, Birna P. Kristinsdottir

Publication date 4 September 1997

zbMATH Keywords

global optimizationMarkov chain analysispure adaptive searchrandom search algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• Analysis and parameter selection for an adaptive random search algorithm
• Analyzing randomized search heuristics: tools from probability theory
• Combining the scalability of local search with the pruning techniques of systematic search
• scientific article; zbMATH DE number 2078361
• Estimates of the complexity of a method to solve the problem of inclusive search
• scientific article; zbMATH DE number 5510694
• Search complexity: a way for the quantitative analysis of the search space
• Pure adaptive search in global optimization
• Parallel Greedy Randomized Adaptive Search Procedures

Cited in

(2)

• Pure adaptive search in global optimization
• Pure random search with virtual extension of feasible region

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 Q4352745)