A modified convergence theorem for a random optimization method

DOI10.1016/0020-0255(77)90026-3MaRDI QIDQ1246503zbMATH OpenOpenAlexFDO

Authors Norio Baba Toshio Shoman, Yoshikazu Sawaragi

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)

Cites work

• A global optimization algorithm using adaptive random search
• An Adaptive Random Search Algorithm for Constrained Minimization
• scientific article; zbMATH DE number 3308846 (Why is no real title available?)
• scientific article; zbMATH DE number 3370187 (Why is no real title available?)
• scientific article; zbMATH DE number 3085434 (Why is no real title available?)
• Method of synthesis of a class of random search algorithms
• Random optimization

Cited in

(6)

• Continuous functions minimization by dynamic random search technique
• A heuristic approach for finding the global minimum: Adaptive random search technique
• A hybrid algorithm for finding a global minimum
• Pure random search with exponential rate of convergency
• Global optimization of functions by the random optimization method
• Anti-cancer drug administration in cancer treatment under stochastic disturbances: modeling and numerical optimization algorithms

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

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