Pure adaptive search in global optimization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3168178 (Why is no real title available?)
- scientific article; zbMATH DE number 3485507 (Why is no real title available?)
- scientific article; zbMATH DE number 3592801 (Why is no real title available?)
- scientific article; zbMATH DE number 3598385 (Why is no real title available?)
- scientific article; zbMATH DE number 3253619 (Why is no real title available?)
- scientific article; zbMATH DE number 3278942 (Why is no real title available?)
- scientific article; zbMATH DE number 3422188 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Estimation of the Minimum of a Function Using Order Statistics
- Generating random vectors uniformly distributed inside and on the surface of different regions
- Hit-and-run algorithms for the identification of nonredundant linear inequalities
- Minimization by Random Search Techniques
- Polynomial affine algorithms for linear programming
- Pure adaptive search in Monte Carlo optimization
- Stochastic Methods for Global Optimization
- Stochastic global optimization methods part I: Clustering methods
- Stochastic global optimization methods part II: Multi level methods
- Technical Note—The Asymptotic Extreme Value Distribution of the Sample Minimum of a Concave Function under Linear Constraints
Cited in
(46)- Towards pure adaptive search
- Pure random search with virtual extension of feasible region
- Pure adaptive search in Monte Carlo optimization
- Hesitant adaptive search for global optimisation
- Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise
- Combining a local search and Grover's algorithm in black-box global optimization
- Pure random search with exponential rate of convergency
- Generating functions and the performance of backtracking adaptive search
- Simulation optimization using multi-time-scale adaptive random search
- A leader-follower model for discrete competitive facility location
- The robust constant and its applications in global optimization
- scientific article; zbMATH DE number 1031415 (Why is no real title available?)
- Stopping and restarting strategy for stochastic sequential search in global optimization
- The robust constant and its applications in random global search for unconstrained global optimization
- Using modifications to Grover's search algorithm for quantum global optimization
- scientific article; zbMATH DE number 1057701 (Why is no real title available?)
- Derivative-free optimization methods
- A Complexity Analysis of Local Search Algorithms in Global Optimization
- A new theoretical framework for analyzing stochastic global optimization algorithms
- A direct stochastic algorithm for global search
- On the investigation of stochastic global optimization algorithms
- Stopping rules in \(k\)-adaptive global random search algorithms
- A global minimization algorithm for Lipschitz functions
- Trajectory optimization using quantum computing
- Complexity of general continuous minimization problems: a survey
- Solving fractional problems with dynamic multistart improving hit-and-run
- Annealing adaptive search, cross-entropy, and stochastic approximation in global optimization
- Backtracking adaptive search: distribution of number of iterations to convergence
- Simulated annealing for constrained global optimization
- Improvement of pure random search in global optimization
- Implementing pure adaptive search for global optimization using Markov chain sampling
- Comparative assessment of algorithms and software for global optimization
- An analytically derived cooling schedule for simulated annealing
- Topics in Lipschitz global optimisation
- Global optimization with a limited solution time
- Computational behavior of a feasible direction method for linear programming
- Recent developments and trends in global optimization
- Discrete backtracking adaptive search for global optimization
- Improving hit-and-run for global optimization
- Convergence guarantees for generalized adaptive stochastic search methods for continuous global optimization
- Implementing pure adaptive search with Grover's quantum algorithm
- Differential evolution methods based on local searches
- Basin hopping networks of continuous global optimization problems
- New reflection generator for simulated annealing in mixed-integer/continuous global optimization
- Expected hitting times for Backtracking Adaptive Search
- Pure adaptive search for finite global optimization
This page was built for publication: Pure adaptive search in global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1184353)
