Nested partitions method for global optimization

Operations Research

Volumn 48, Issue 3, 2000, Pages 390-407

  Shi, L ^a   Olafsson S ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; MATHEMATICAL PROGRAMMING; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; SAMPLING;

MULTISTART ALGORITHM; NESTED PARTITIONS METHOD;

GLOBAL OPTIMIZATION;

EID: 0034179713     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.48.3.390.12436     Document Type: Article

References (20)

1. A modified convergence theorem for a random optimization method
2. A note on adapting methods for continuous global optimization to the discrete case
3. On when to stop sampling for the maximum
4. Stochastic methods
5. Estimation of the minimum of a function using order statistics
6. Ordinal optimization of DEDS
7. Random optimization
8. Simulated annealing for constrained global optimization
9. Stochastic techniques for global optimization
10. Nested partitions method for stochastic optimization
11. A new parallel randomized algorithms for the traveling salesman problem
12. Minimization by random search techniques
13. Adaptive partitioned random search to global optimization
14. Pure adaptive search in global optimization
15. Pure adaptive search for finite global optimization