Improvement of pure random search in global optimization

DOI10.1007/S11741-000-0002-4zbMATH Open0986.90039OpenAlexW1965699191MaRDI QIDQ4521055FDOQ4521055

Authors: Jianping Peng, Dinghua Shi 

Publication date: 19 December 2000

Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11741-000-0002-4

Recommendations

• Modified controlled random search algorithms
• Stochastic global optimization.
• Computational algorithms based on random search for solving global optimization problems
• scientific article; zbMATH DE number 3920191
• Stochastic adaptive search for global optimization.

zbMATH Keywords

global optimizationrandom searchstochastic global optimization algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26)

Cites Work

• Optimization by simulated annealing
• A Simplex Method for Function Minimization
• Global optimization by controlled random search
• Pure adaptive search in global optimization
• Title not available (Why is that?)
• A method of unconstrained global optimization
• Stochastic Methods for Global Optimization
• Global optimization algorithms for a CAD workstation
• Title not available (Why is that?)
• Global optimization and stochastic differential equations
• Progressive global random search of continuous functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A numerical study of some modified versions of controlled random search method for global optimization

Cited In (7)

• Continuous functions minimization by dynamic random search technique
• Empirical study of the improved UNIRANDI local search method
• A new theoretical framework for analyzing stochastic global optimization algorithms
• Random orthocenter strategy in interior search algorithm and its engineering application
• Importance of search-domain reduction in random optimization
• On benchmarking stochastic global optimization algorithms
• Pure random search with virtual extension of feasible region

This page was built for publication: Improvement of pure random search in global optimization

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