Pages that link to "Item:Q5905037"
From MaRDI portal
The following pages link to Expected number of steps of a random optimization method (Q5905037):
Displaying 11 items.
- On the rate of convergence of one inhomogeneous Markov algorithm of search for extremum (Q357763) (← links)
- Expected number of steps of a random optimization method. Reply (Q801821) (← links)
- Alternative sampling strategy for a random optimization algorithm (Q1321382) (← links)
- On the efficiency of a continuous version of the simulated annealing algorithm (Q1359728) (← links)
- On the convergence of the Baba and Dorea random optimization methods (Q1825142) (← links)
- Random gradient-free minimization of convex functions (Q2397749) (← links)
- Monotonous random search on a torus: integral upper bounds for the complexity (Q2455423) (← links)
- Effort associated with a class of random optimization methods (Q2640454) (← links)
- Stochastic Three Points Method for Unconstrained Smooth Minimization (Q4971022) (← links)
- Expected number of steps of a random optimization method (Q5896509) (← links)
- Time‐discretizations of differentiators: Design of implicit algorithms and comparative analysis (Q6071481) (← links)
