Pure adaptive search in global optimization

Pure adaptive seach iteratively constructs a sequence of interior points uniformly distributed within the corresponding sequence of nested improving regions of the feasible space. That is, at any iteration, the next point in the sequence is uniformly distributed over the region of feasible space containing all points that are strictly superior in value to the previous points in the sequence. The complexity of this algorithm is measured by the expected number of iterations required to achieve a given accuracy of solution. We show that for global mathematical programs satisfying the Lipschitz condition, its complexity increases at mostlinearly in the dimension of the problem.

[1]  J. D. T. Oliveira,et al.  The Asymptotic Theory of Extreme Order Statistics , 1979 .

[2]  Robert L. Smith,et al.  Technical Note - The Asymptotic Extreme Value Distribution of the Sample Minimum of a Concave Function under Linear Constraints , 1983, Oper. Res..

[3]  Samuel H. Brooks.  A Discussion of Random Methods for Seeking Maxima , 1958 .

[4]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[5]  H. Zimmermann.  Towards global optimization 2: L.C.W. DIXON and G.P. SZEGÖ (eds.) North-Holland, Amsterdam, 1978, viii + 364 pages, US $ 44.50, Dfl. 100,-. , 1979 .

[6]  G. T. Timmer,et al.  Stochastic global optimization methods part I: Clustering methods , 1987, Math. Program..

[7]  Roger J.-B. Wets,et al.  Minimization by Random Search Techniques , 1981, Math. Oper. Res..

[8]  Robert L. Smith,et al.  Pure adaptive search in monte carlo optimization , 1989, Math. Program..

[9]  Clóvis C. Gonzaga,et al.  Polynomial affine algorithms for linear programming , 1990, Math. Program..

[10]  Maurice G. Kendall,et al.  A Course in the Geometry of n Dimensions , 1962 .

[11]  R. Y. Rubinstein.  Generating random vectors uniformly distributed inside and on the surface of different regions , 1982 .

[12]  K. Steiglitz,et al.  Adaptive step size random search , 1968 .

[13]  L. Haan.  Estimation of the Minimum of a Function Using Order Statistics , 1980 .

[14]  G. T. Timmer,et al.  Stochastic global optimization methods part II: Multi level methods , 1987, Math. Program..

[15]  James Renegar,et al.  A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..

[16]  Robert M. Freund,et al.  Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function , 1991, Math. Program..

[17]  Arnon Boneh.  Preduce — A Probabilistic Algorithm Identifying Redundancy by a Random Feasible Point Generator (RFPG) , 1983 .

[18]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[19]  Robert L. Smith,et al.  Hit-and-run algorithms for the identification of nonredundant linear inequalities , 1987, Math. Program..

[20]  Robert L. Smith,et al.  Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions , 1984, Oper. Res..

[21]  Alexander H. G. Rinnooy Kan,et al.  Stochastic methods for global optimization , 1984 .