Pure adaptive search in global optimization
- 1 January 1992
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 53 (1-3) , 323-338
- https://doi.org/10.1007/bf01585710
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Pure adaptive search in monte carlo optimizationMathematical Programming, 1989
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- Stochastic global optimization methods part I: Clustering methodsMathematical Programming, 1987
- Stochastic global optimization methods part II: Multi level methodsMathematical Programming, 1987
- Hit-and-run algorithms for the identification of nonredundant linear inequalitiesMathematical Programming, 1987
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Stochastic Methods for Global OptimizationAmerican Journal of Mathematical and Management Sciences, 1984
- Generating random vectors uniformly distributed inside and on the surface of different regionsEuropean Journal of Operational Research, 1982
- Estimation of the Minimum of a Function Using Order StatisticsJournal of the American Statistical Association, 1981
- Adaptive step size random searchIEEE Transactions on Automatic Control, 1968