Pure adaptive search in Monte Carlo optimization

DOI10.1007/BF01582296zbMath0671.90047OpenAlexW2090797181MaRDI QIDQ1119467

Zelda B. Zabinsky, Robert L. Smith, Nitin R. Patel

Publication date: 1989

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582296

zbMATH Keywords

feasible direction methodinterior moveWolfe's reduced gradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

The robust constant and its applications in random global search for unconstrained global optimization, Improving hit-and-run for global optimization, Simulated annealing for constrained global optimization, Towards pure adaptive search, Pure adaptive search for finite global optimization, Expected hitting times for Backtracking Adaptive Search, Implementing pure adaptive search with Grover's quantum algorithm, Pure adaptive search in global optimization, Complexity of general continuous minimization problems: a survey, Trajectory optimization using quantum computing, Using modifications to Grover's search algorithm for quantum global optimization, Performance extrapolation in discrete-event systems simulation, Derivative-free optimization methods, Hesitant adaptive search for global optimisation, On the investigation of stochastic global optimization algorithms, A new theoretical framework for analyzing stochastic global optimization algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• A stochastic method for global optimization
• Stochastic Methods for Global Optimization
• Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
• Technical Note—The Asymptotic Extreme Value Distribution of the Sample Minimum of a Concave Function under Linear Constraints
• Estimation of the Minimum of a Function Using Order Statistics
• Minimization by Random Search Techniques