Pages that link to "Item:Q2366968"
From MaRDI portal
The following pages link to Improving hit-and-run for global optimization (Q2366968):
Displaying 31 items.
- Pattern hit-and-run for sampling efficiently on polytopes (Q433826) (← links)
- Pattern discrete and mixed hit-and-run for global optimization (Q645554) (← links)
- A generalization of the Solis-Wets method (Q651065) (← links)
- CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method (Q679580) (← links)
- Matching stochastic algorithms to objective function landscapes (Q813359) (← links)
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems (Q813367) (← links)
- The multiple traveling salesmen problem with moving targets (Q895767) (← links)
- The vehicle routing problem with coupled time windows (Q926344) (← links)
- Adaptive search with stochastic acceptance probabilities for global optimization (Q943781) (← links)
- New reflection generator for simulated annealing in mixed-integer/continuous global optimization (Q1291825) (← links)
- Application of Bayesian approach to numerical methods of global and stochastic optimization (Q1327427) (← links)
- Simulated annealing for constrained global optimization (Q1337127) (← links)
- Simulated annealing for complex portfolio selection problems. (Q1406489) (← links)
- Implementing pure adaptive search with Grover's quantum algorithm (Q1411475) (← links)
- A direct stochastic algorithm for global search (Q1412565) (← links)
- Towards pure adaptive search (Q1905968) (← links)
- \(t\)-copula from the viewpoint of tail dependence matrices (Q2146466) (← links)
- Stopping and restarting strategy for stochastic sequential search in global optimization (Q2269595) (← links)
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (Q2352416) (← links)
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (Q2393650) (← links)
- Iterative MC-algorithm to solve the global optimization problems (Q2397267) (← links)
- Solving fractional problems with dynamic multistart improving hit-and-run (Q2468758) (← links)
- Single observation adaptive search for discrete and continuous stochastic optimization (Q2661541) (← links)
- An optimal scaling to computationally tractable dimensionless models: study of latex particles morphology formation (Q2698802) (← links)
- Pure Random Search with exponential rate of convergency (Q3553768) (← links)
- Slow convergence of the Gibbs sampler (Q4243790) (← links)
- Single Observation Adaptive Search for Continuous Simulation Optimization (Q5131547) (← links)
- A Hit‐and‐Run approach for generating scale invariant Small World networks (Q5191130) (← links)
- Annealing adaptive search, cross-entropy, and stochastic approximation in global optimization (Q5198687) (← links)
- Simulation Optimization: A Review and Exploration in the New Era of Cloud Computing and Big Data (Q5265460) (← links)
- Exploring the space of perfectly balanced rhythms and scales (Q5374502) (← links)
