A modified convergence theorem for a random optimization method

DOI10.1016/0020-0255(77)90026-3zbMath0376.93048OpenAlexW2094847612MaRDI QIDQ1246503

Yoshikazu Sawaragi, Norio Baba Toshio Shoman

Publication date: 1977

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(77)90026-3

Mathematics Subject Classification ID

Stochastic programming (90C15)

Related Items (5)

Pure Random Search with exponential rate of convergency ⋮ A hybrid algorithm for finding a global minimum ⋮ Continuous functions minimization by dynamic random search technique ⋮ A heuristic approach for finding the global minimum: Adaptive random search technique ⋮ Global optimization of functions by the random optimization method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A global optimization algorithm using adaptive random search
• Random optimization
• Method of synthesis of a class of random search algorithms
• An Adaptive Random Search Algorithm for Constrained Minimization

This page was built for publication: A modified convergence theorem for a random optimization method