An Adaptive Random Search Algorithm for Constrained Minimization

DOI10.1109/TC.1972.5009077MaRDI QIDQ5650200zbMATH OpenFDO

Authors Edward Beltrami, J. P. Indusi

Publication date 1972

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1972.5009077

Mathematics Subject Classification ID

Search theory (90B40)

Cited in

(8)

• Globally convergent version of Robinson's algorithm for general nonlinear programming problems without using derivatives
• A global optimization algorithm using adaptive random search
• Convergence of a random optimization method for constrained optimization problems
• A comparative performance evaluation of 27 nonlinear programming codes
• A modified convergence theorem for a random optimization method
• An optimized step-size random search (ossrs)
• Genetically controlled random search: a global optimization method for continuous multidimensional functions
• A note on the method of multipliers

This page was built for publication: An Adaptive Random Search Algorithm for Constrained Minimization

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