Pages that link to "Item:Q1184353"

The following pages link to Pure adaptive search in global optimization (Q1184353):

Displaying 40 items.

• The robust constant and its applications in random global search for unconstrained global optimization (Q280976) (← links)
• Differential evolution methods based on local searches (Q336908) (← links)
• A leader-follower model for discrete competitive facility location (Q342067) (← links)
• Convergence guarantees for generalized adaptive stochastic search methods for continuous global optimization (Q613428) (← links)
• On the investigation of stochastic global optimization algorithms (Q813356) (← links)
• Comparative assessment of algorithms and software for global optimization (Q813366) (← links)
• Backtracking adaptive search: distribution of number of iterations to convergence (Q857596) (← links)
• Combining a local search and Grover's algorithm in black-box global optimization (Q946303) (← links)
• Using modifications to Grover's search algorithm for quantum global optimization (Q992656) (← links)
• Generating functions and the performance of backtracking adaptive search (Q995932) (← links)
• Hesitant adaptive search for global optimisation (Q1290601) (← links)
• New reflection generator for simulated annealing in mixed-integer/continuous global optimization (Q1291825) (← links)
• Simulated annealing for constrained global optimization (Q1337127) (← links)
• Implementing pure adaptive search with Grover's quantum algorithm (Q1411475) (← links)
• A direct stochastic algorithm for global search (Q1412565) (← links)
• Recent developments and trends in global optimization (Q1593827) (← links)
• Basin hopping networks of continuous global optimization problems (Q1642814) (← links)
• Towards pure adaptive search (Q1905968) (← links)
• Pure adaptive search for finite global optimization (Q1906281) (← links)
• Global optimization with a limited solution time (Q1918987) (← links)
• Stopping rules in \(k\)-adaptive global random search algorithms (Q1959253) (← links)
• Pure random search with virtual extension of feasible region (Q2093284) (← links)
• Stopping and restarting strategy for stochastic sequential search in global optimization (Q2269595) (← links)
• Trajectory optimization using quantum computing (Q2274880) (← links)
• Improving hit-and-run for global optimization (Q2366968) (← links)
• An analytically derived cooling schedule for simulated annealing (Q2460137) (← links)
• A global minimization algorithm for Lipschitz functions (Q2465562) (← links)
• Solving fractional problems with dynamic multistart improving hit-and-run (Q2468758) (← links)
• The Robust Constant and Its Applications in Global Optimization (Q2942507) (← links)
• Pure Random Search with exponential rate of convergency (Q3553768) (← links)
• Topics in Lipschitz global optimisation (Q4346952) (← links)
• A new theoretical framework for analyzing stochastic global optimization algorithms (Q4515594) (← links)
• Improvement of pure random search in global optimization (Q4521055) (← links)
• A Complexity Analysis of Local Search Algorithms in Global Optimization (Q4806344) (← links)
• Expected hitting times for Backtracking Adaptive Search (Q4822673) (← links)
• Annealing adaptive search, cross-entropy, and stochastic approximation in global optimization (Q5198687) (← links)
• Simulation Optimization Using Multi-Time-Scale Adaptive Random Search (Q5207135) (← links)
• Derivative-free optimization methods (Q5230522) (← links)
• Complexity of general continuous minimization problems: a survey (Q5717540) (← links)
• Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise (Q6166097) (← links)