Pure adaptive search in global optimization
From MaRDI portal
Publication:1184353
DOI10.1007/BF01585710zbMath0756.90086OpenAlexW1979881015MaRDI QIDQ1184353
Zelda B. Zabinsky, Robert L. Smith
Publication date: 28 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585710
Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (40)
Improvement of pure random search in global optimization ⋮ 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 ⋮ A Complexity Analysis of Local Search Algorithms in Global Optimization ⋮ Basin hopping networks of continuous global optimization problems ⋮ Differential evolution methods based on local searches ⋮ Backtracking adaptive search: distribution of number of iterations to convergence ⋮ Towards pure adaptive search ⋮ Pure adaptive search for finite global optimization ⋮ A leader-follower model for discrete competitive facility location ⋮ Expected hitting times for Backtracking Adaptive Search ⋮ Global optimization with a limited solution time ⋮ The Robust Constant and Its Applications in Global Optimization ⋮ Convergence guarantees for generalized adaptive stochastic search methods for continuous global optimization ⋮ Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise ⋮ Implementing pure adaptive search with Grover's quantum algorithm ⋮ A direct stochastic algorithm for global search ⋮ Stopping rules in \(k\)-adaptive global random search algorithms ⋮ Topics in Lipschitz global optimisation ⋮ An analytically derived cooling schedule for simulated annealing ⋮ Pure Random Search with exponential rate of convergency ⋮ A global minimization algorithm for Lipschitz functions ⋮ Combining a local search and Grover's algorithm in black-box global optimization ⋮ Solving fractional problems with dynamic multistart improving hit-and-run ⋮ Complexity of general continuous minimization problems: a survey ⋮ Stopping and restarting strategy for stochastic sequential search in global optimization ⋮ Trajectory optimization using quantum computing ⋮ Using modifications to Grover's search algorithm for quantum global optimization ⋮ Annealing adaptive search, cross-entropy, and stochastic approximation in global optimization ⋮ Generating functions and the performance of backtracking adaptive search ⋮ Simulation Optimization Using Multi-Time-Scale Adaptive Random Search ⋮ Derivative-free optimization methods ⋮ Hesitant adaptive search for global optimisation ⋮ New reflection generator for simulated annealing in mixed-integer/continuous global optimization ⋮ Pure random search with virtual extension of feasible region ⋮ Recent developments and trends in global optimization ⋮ On the investigation of stochastic global optimization algorithms ⋮ Comparative assessment of algorithms and software for global optimization ⋮ A new theoretical framework for analyzing stochastic global optimization algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Pure adaptive search in Monte Carlo optimization
- Generating random vectors uniformly distributed inside and on the surface of different regions
- Polynomial affine algorithms for linear programming
- Hit-and-run algorithms for the identification of nonredundant linear inequalities
- 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
- Stochastic global optimization methods part I: Clustering methods
- Stochastic global optimization methods part II: Multi level methods
- Estimation of the Minimum of a Function Using Order Statistics
- Minimization by Random Search Techniques
This page was built for publication: Pure adaptive search in global optimization
